@visactor/vutils 1.0.26 → 1.0.28

package/README.zh-CN.md

@@ -10,3 +10,20 @@ normalQuantile(0.975); // 约 1.95996398454
 回归区间的 `alpha` 表示显著性水平，置信度为 `1-alpha`，默认 `alpha=0.05`。区间通过下尾概率计算临界值，避免 `1-alpha/2` 在 `alpha` 极小时舍入为 1。
 
 `alpha=0` 时，正标准误产生无限区间，零标准误产生退化区间；`alpha=1` 产生退化区间。非有限 `alpha` 或超出 `[0,1]` 的值产生 NaN 区间端点。
+
+## LOWESS 回归
+
+`regressionLowess` 保留历史默认参数 `span=0.3`、`iterations=2`；仅省略的参数使用默认值，显式 `iterations=0` 仍表示不做稳健重加权。默认使用全部有效观测；数值稳定性、最近邻选择以及同一模型下 `predict`、`evaluateGrid`、`fitted` 和置信区间均值一致性的修复继续保留。
+
+需要对齐 statsmodels 默认参数的调用方，应显式指定 `span=2/3`、`iterations=3`。StatPlots 已显式传入这些参数，不依赖 VUtils 的默认选择。
+
+```ts
+import { regressionLowess } from '@visactor/vutils';
+
+const data = [0, 1, 2, 3, 4].map(x => ({ x, y: x + Math.sin(x) }));
+const model = regressionLowess(data); // span=0.3、iterations=2
+const statsmodelsModel = regressionLowess(data, undefined, undefined, {
+  span: 2 / 3,
+  iterations: 3
+});
+```

package/cjs/common/ascending.js

@@ -6,5 +6,4 @@ function ascending(a, b) {
 
 Object.defineProperty(exports, "__esModule", {
     value: !0
-}), exports.ascending = void 0, exports.ascending = ascending;
-//# sourceMappingURL=ascending.js.map
+}), exports.ascending = void 0, exports.ascending = ascending;

package/cjs/common/deviation.js

@@ -11,4 +11,5 @@ function deviation(values, valueof) {
     return v ? Math.sqrt(v) : v;
 }
 
-exports.deviation = deviation;
+exports.deviation = deviation;
+//# sourceMappingURL=deviation.js.map

package/cjs/common/getType.js

@@ -6,5 +6,4 @@ Object.defineProperty(exports, "__esModule", {
 
 const getType = value => ({}.toString.call(value).replace(/^\[object /, "").replace(/]$/, ""));
 
-exports.default = getType;
-//# sourceMappingURL=getType.js.map
+exports.default = getType;

package/cjs/common/isFunction.js

@@ -32,4 +32,5 @@ Object.defineProperty(exports, "__esModule", {
 // eslint-disable-next-line @typescript-eslint/ban-types
 const isFunction = value => "function" == typeof value;
 
-exports.default = isFunction;
+exports.default = isFunction;
+//# sourceMappingURL=isFunction.js.map

package/cjs/common/isObject.js

@@ -31,5 +31,4 @@ const isObject = value => {
     return null !== value && "object" === type || "function" === type;
 };
 
-exports.default = isObject;
-//# sourceMappingURL=isObject.js.map
+exports.default = isObject;

package/cjs/common/isPrototype.js

@@ -10,4 +10,4 @@ const objectProto = Object.prototype, isPrototype = function(value) {
 };
 
 exports.default = isPrototype;
-//# sourceMappingURL=isPrototype.js.map
+//# sourceMappingURL=isPrototype.js.map

package/cjs/common/isRegExp.js

@@ -13,4 +13,4 @@ Object.defineProperty(exports, "__esModule", {
 const isType_1 = __importDefault(require("./isType")), isRegExp = value => (0, isType_1.default)(value, "RegExp");
 
 exports.default = isRegExp;
-//# sourceMappingURL=isRegExp.js.map
+//# sourceMappingURL=isRegExp.js.map

package/cjs/common/isShallowEqual.js

@@ -32,4 +32,4 @@ function isShallowEqual(objA, objB) {
 }
 
 exports.isShallowEqual = isShallowEqual;
-//# sourceMappingURL=isShallowEqual.js.map
+//# sourceMappingURL=isShallowEqual.js.map

package/cjs/common/isString.js

@@ -28,4 +28,4 @@ const isType_1 = __importDefault(require("./isType")), isString = (value, fuzzy
  * isString(1)
  * // => false
  */ exports.default = isString;
-//# sourceMappingURL=isString.js.map
+//# sourceMappingURL=isString.js.map

package/cjs/common/isType.js

@@ -13,4 +13,4 @@ Object.defineProperty(exports, "__esModule", {
 const isType = (value, type) => Object.prototype.toString.call(value) === `[object ${type}]`;
 
 exports.default = isType;
-//# sourceMappingURL=isType.js.map
+//# sourceMappingURL=isType.js.map

package/cjs/common/kde.d.ts

@@ -22,6 +22,10 @@ export interface KDEOptions {
     kernel?: Kernel;
     bandwidth?: number;
     bandwidthMethod?: 'scott' | 'silverman';
+    /** Automatic bandwidth uses population deviation by default, preserving existing behavior. */
+    standardDeviation?: 'sample' | 'population';
+    /** Positive multiplier applied once to either fixed or automatic bandwidth. */
+    bandwidthAdjust?: number;
 }
 export interface KDEEvaluator {
     bandwidth: number;

package/cjs/common/kde.js

@@ -11,8 +11,7 @@
     value: !0
 }), exports.kde = exports.silverman = exports.scott = exports.epanechnikov = exports.gaussian = void 0;
 
-/** Gaussian kernel (standard normal) */
-const gaussian = u => 1 / Math.sqrt(2 * Math.PI) * Math.exp(-.5 * u * u);
+const mean_1 = require("./mean"), variance_1 = require("./variance"), gaussian = u => 1 / Math.sqrt(2 * Math.PI) * Math.exp(-.5 * u * u);
 
 exports.gaussian = gaussian;
 
@@ -36,32 +35,44 @@ function silverman(n, std, dim = 1) {
 /**
  * Compute standard deviation for numeric array
  */
-function std(values) {
+function std(values, convention) {
     const n = values.length;
-    if (0 === n) return 0;
-    let mean = 0;
-    for (let i = 0; i < n; i++) mean += values[i];
-    mean /= n;
-    let s = 0;
+    if (n < 2) return 0;
+    const center = (0, mean_1.mean)(values), differences = [];
+    let scale = 0, sourceScale = 1;
     for (let i = 0; i < n; i++) {
-        const d = values[i] - mean;
-        s += d * d;
+        const difference = values[i] - center;
+        differences.push(difference), scale = Math.max(scale, Math.abs(difference));
     }
-    return Math.sqrt(s / n);
+    // Finite values of opposite signs can overflow subtraction although population deviation is representable.
+        if (scale === 1 / 0) {
+        sourceScale = Math.abs(center);
+        for (const value of values) sourceScale = Math.max(sourceScale, Math.abs(value));
+        scale = 0;
+        for (let i = 0; i < n; i++) differences[i] = values[i] / sourceScale - center / sourceScale, 
+        scale = Math.max(scale, Math.abs(differences[i]));
+    }
+    if (0 === scale) return 0;
+    for (let i = 0; i < n; i++) differences[i] /= scale;
+    const correction = "population" === convention ? (n - 1) / n : 1;
+    return Math.sqrt((0, variance_1.variance)(differences) * correction) * scale * sourceScale;
 }
 
 /**
  * Factory: create a KDE evaluator for given data and options.
  * Usage: const model = kde(data, options); model.evaluate(x) or model.evaluate([x1,x2])
  */ function kde(data, options = {}) {
+    const deviation = void 0 === options.standardDeviation ? "population" : options.standardDeviation, adjustment = void 0 === options.bandwidthAdjust ? 1 : options.bandwidthAdjust;
+    if ("sample" !== deviation && "population" !== deviation) throw new RangeError("standardDeviation must be sample or population");
+    if (!Number.isFinite(adjustment) || adjustment <= 0) throw new RangeError("bandwidthAdjust must be finite and positive");
     const n = data.length, kernel = options.kernel || exports.gaussian;
     let h = options.bandwidth;
     if (!h || h <= 0) {
-        const sd = std(data) || 0, method = options.bandwidthMethod || "scott";
+        const sd = std(data, deviation) || 0, method = options.bandwidthMethod || "scott";
         h = "silverman" === method ? silverman(n, sd, 1) : scott(n, sd, 1);
     }
     // if still zero (constant data), evaluator returns zeros
-        if (!h || h <= 0) {
+    if (h *= adjustment, !h || h <= 0) {
         return {
             bandwidth: 0,
             kernel: kernel,
@@ -97,7 +108,7 @@ function std(values) {
             }
         };
     }
-    const invNh = 1 / (n * h);
+    const invNh = 1 / n / h;
     function evalPoint(x) {
         let sum = 0;
         for (let j = 0; j < n; j++) sum += kernel((x - data[j]) / h);

package/cjs/common/kde.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/kde.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;AAIH,wCAAwC;AACjC,MAAM,QAAQ,GAAW,CAAC,CAAS,EAAE,EAAE;IAC5C,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9C,OAAO,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7C,CAAC,CAAC;AAHW,QAAA,QAAQ,YAGnB;AAEF,4CAA4C;AACrC,MAAM,YAAY,GAAW,CAAC,CAAS,EAAE,EAAE;IAChD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5C,CAAC,CAAC;AAHW,QAAA,YAAY,gBAGvB;AAEF;;;;GAIG;AACH,SAAgB,KAAK,CAAC,CAAS,EAAE,GAAW,EAAE,GAAG,GAAG,CAAC;IACnD,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,EAAE;QACvB,OAAO,CAAC,CAAC;KACV;IACD,OAAO,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC;AALD,sBAKC;AAED,SAAgB,SAAS,CAAC,CAAS,EAAE,GAAW,EAAE,GAAG,GAAG,CAAC;IACvD,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,EAAE;QACvB,OAAO,CAAC,CAAC;KACV;IACD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACtD,OAAO,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAND,8BAMC;AASD;;GAEG;AACH,SAAS,GAAG,CAAC,MAAgB;IAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,EAAE;QACX,OAAO,CAAC,CAAC;KACV;IACD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1B,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;KACnB;IACD,IAAI,IAAI,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAC3B,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KACZ;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC1B,CAAC;AAkBD;;;GAGG;AACH,SAAgB,GAAG,CAAC,IAAc,EAAE,UAAsB,EAAE;IAC1D,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,gBAAQ,CAAC;IAE1C,IAAI,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC;IAC1B,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QAChB,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,eAAe,IAAI,OAAO,CAAC;QAClD,IAAI,MAAM,KAAK,WAAW,EAAE;YAC1B,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SACzB;aAAM;YACL,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SACrB;KACF;IAED,yDAAyD;IACzD,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QAChB,MAAM,SAAS,GAAG,CAAC,CAAoB,EAAE,EAAE;YACzC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBACpB,MAAM,GAAG,GAAa,EAAE,CAAC;gBACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACjC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBACb;gBACD,OAAO,GAAG,CAAC;aACZ;YACD,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QACF,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,EAAE;YAC9B,MAAM,GAAG,GAA+B,EAAE,CAAC;YAC3C,IAAI,CAAC,IAAI,CAAC,EAAE;gBACV,OAAO,GAAG,CAAC;aACZ;YACD,iDAAiD;YACjD,IAAI,GAAG,GAAG,QAAQ,CAAC;YACnB,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,GAAG,GAAG,EAAE;oBACX,GAAG,GAAG,CAAC,CAAC;iBACT;gBACD,IAAI,CAAC,GAAG,GAAG,EAAE;oBACX,GAAG,GAAG,CAAC,CAAC;iBACT;aACF;YACD,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;gBACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;iBAC1B;gBACD,OAAO,GAAG,CAAC;aACZ;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aAC5B;YACD,OAAO,GAAG,CAAC;QACb,CAAC,CAAC;QACF,OAAO;YACL,SAAS,EAAE,CAAC;YACZ,MAAM;YACN,QAAQ,EAAE,SAAgB;YAC1B,YAAY,EAAE,SAAS;SACxB,CAAC;KACH;IAED,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE1B,SAAS,SAAS,CAAC,CAAS;QAC1B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;SAClC;QACD,OAAO,GAAG,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,SAAS,QAAQ,CAAC,CAAoB;QACpC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACpB,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B;YACD,OAAO,GAAG,CAAC;SACZ;QACD,OAAO,SAAS,CAAC,CAAW,CAAC,CAAC;IAChC,CAAC;IAED,OAAO;QACL,SAAS,EAAE,CAAC;QACZ,MAAM;QACN,QAAQ,EAAE,QAAe;QACzB,YAAY,CAAC,CAAS;YACpB,MAAM,GAAG,GAA+B,EAAE,CAAC;YAC3C,IAAI,CAAC,IAAI,CAAC,EAAE;gBACV,OAAO,GAAG,CAAC;aACZ;YACD,qBAAqB;YACrB,IAAI,GAAG,GAAG,QAAQ,CAAC;YACnB,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,GAAG,GAAG,EAAE;oBACX,GAAG,GAAG,CAAC,CAAC;iBACT;gBACD,IAAI,CAAC,GAAG,GAAG,EAAE;oBACX,GAAG,GAAG,CAAC,CAAC;iBACT;aACF;YACD,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;gBACzC,OAAO,GAAG,CAAC;aACZ;YACD,IAAI,GAAG,KAAK,GAAG,EAAE;gBACf,wBAAwB;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;iBACzC;gBACD,OAAO,GAAG,CAAC;aACZ;YAED,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;gBAC7C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aAClC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;KACF,CAAC;AACJ,CAAC;AA5HD,kBA4HC;AAED,kBAAe,GAAG,CAAC","file":"kde.js","sourcesContent":["/**\n * Kernel Density Estimation (KDE) utilities\n *\n * Exports:\n * - Kernel functions: gaussian, epanechnikov\n * - bandwidth selectors: scott, silverman\n * - kde: main function to compute density estimates at provided points\n */\n\nexport type Kernel = (u: number) => number;\n\n/** Gaussian kernel (standard normal) */\nexport const gaussian: Kernel = (u: number) => {\n  const invSqrt2Pi = 1 / Math.sqrt(2 * Math.PI);\n  return invSqrt2Pi * Math.exp(-0.5 * u * u);\n};\n\n/** Epanechnikov kernel (compact support) */\nexport const epanechnikov: Kernel = (u: number) => {\n  const absu = Math.abs(u);\n  return absu <= 1 ? 0.75 * (1 - u * u) : 0;\n};\n\n/**\n * Bandwidth selectors\n * - scott: h = n^{-1/(d+4)} * std\n * - silverman: h = ( (4/(d+2))^{1/(d+4)} ) * n^{-1/(d+4)} * std\n */\nexport function scott(n: number, std: number, dim = 1) {\n  if (n <= 0 || std === 0) {\n    return 0;\n  }\n  return std * Math.pow(n, -1 / (dim + 4));\n}\n\nexport function silverman(n: number, std: number, dim = 1) {\n  if (n <= 0 || std === 0) {\n    return 0;\n  }\n  const factor = Math.pow(4 / (dim + 2), 1 / (dim + 4));\n  return factor * std * Math.pow(n, -1 / (dim + 4));\n}\n\nexport interface KDEOptions {\n  kernel?: Kernel;\n  bandwidth?: number; // fixed bandwidth\n  bandwidthMethod?: 'scott' | 'silverman';\n  // if bandwidth not provided, compute from data using method\n}\n\n/**\n * Compute standard deviation for numeric array\n */\nfunction std(values: number[]) {\n  const n = values.length;\n  if (n === 0) {\n    return 0;\n  }\n  let mean = 0;\n  for (let i = 0; i < n; i++) {\n    mean += values[i];\n  }\n  mean /= n;\n  let s = 0;\n  for (let i = 0; i < n; i++) {\n    const d = values[i] - mean;\n    s += d * d;\n  }\n  return Math.sqrt(s / n);\n}\n\nexport interface KDEEvaluator {\n  bandwidth: number;\n  kernel: Kernel;\n  /**\n   * Evaluate density at a single point or array of points.\n   * - If given a number, returns a number.\n   * - If given an array, returns an array aligned with input.\n   */\n  evaluate: ((x: number) => number) & ((xs: number[]) => number[]);\n  /**\n   * Produce N uniformly spaced points across the data range and evaluate densities.\n   * Returns an array { x: number, y: number }[].\n   */\n  evaluateGrid: (N: number) => { x: number; y: number }[];\n}\n\n/**\n * Factory: create a KDE evaluator for given data and options.\n * Usage: const model = kde(data, options); model.evaluate(x) or model.evaluate([x1,x2])\n */\nexport function kde(data: number[], options: KDEOptions = {}): KDEEvaluator {\n  const n = data.length;\n  const kernel = options.kernel || gaussian;\n\n  let h = options.bandwidth;\n  if (!h || h <= 0) {\n    const sd = std(data) || 0;\n    const method = options.bandwidthMethod || 'scott';\n    if (method === 'silverman') {\n      h = silverman(n, sd, 1);\n    } else {\n      h = scott(n, sd, 1);\n    }\n  }\n\n  // if still zero (constant data), evaluator returns zeros\n  if (!h || h <= 0) {\n    const zerosEval = (x: number | number[]) => {\n      if (Array.isArray(x)) {\n        const out: number[] = [];\n        for (let i = 0; i < x.length; i++) {\n          out.push(0);\n        }\n        return out;\n      }\n      return 0;\n    };\n    const zerosGrid = (N: number) => {\n      const out: { x: number; y: number }[] = [];\n      if (N <= 0) {\n        return out;\n      }\n      // compute data min (use data range if available)\n      let min = Infinity;\n      let max = -Infinity;\n      for (let j = 0; j < n; j++) {\n        const v = data[j];\n        if (v < min) {\n          min = v;\n        }\n        if (v > max) {\n          max = v;\n        }\n      }\n      if (min === Infinity || max === -Infinity) {\n        for (let i = 0; i < N; i++) {\n          out.push({ x: 0, y: 0 });\n        }\n        return out;\n      }\n      for (let i = 0; i < N; i++) {\n        out.push({ x: min, y: 0 });\n      }\n      return out;\n    };\n    return {\n      bandwidth: 0,\n      kernel,\n      evaluate: zerosEval as any,\n      evaluateGrid: zerosGrid\n    };\n  }\n\n  const invNh = 1 / (n * h);\n\n  function evalPoint(x: number) {\n    let sum = 0;\n    for (let j = 0; j < n; j++) {\n      sum += kernel((x - data[j]) / h);\n    }\n    return sum * invNh;\n  }\n\n  function evaluate(x: number | number[]) {\n    if (Array.isArray(x)) {\n      const out: number[] = [];\n      for (let i = 0; i < x.length; i++) {\n        out.push(evalPoint(x[i]));\n      }\n      return out;\n    }\n    return evalPoint(x as number);\n  }\n\n  return {\n    bandwidth: h,\n    kernel,\n    evaluate: evaluate as any,\n    evaluateGrid(N: number) {\n      const out: { x: number; y: number }[] = [];\n      if (N <= 0) {\n        return out;\n      }\n      // compute data range\n      let min = Infinity;\n      let max = -Infinity;\n      for (let i = 0; i < n; i++) {\n        const v = data[i];\n        if (v < min) {\n          min = v;\n        }\n        if (v > max) {\n          max = v;\n        }\n      }\n      if (min === Infinity || max === -Infinity) {\n        return out;\n      }\n      if (min === max) {\n        // single point repeated\n        for (let i = 0; i < N; i++) {\n          out.push({ x: min, y: evalPoint(min) });\n        }\n        return out;\n      }\n\n      const step = (max - min) / (N - 1);\n      for (let i = 0; i < N; i++) {\n        const x = i === N - 1 ? max : min + step * i;\n        out.push({ x, y: evalPoint(x) });\n      }\n      return out;\n    }\n  };\n}\n\nexport default kde;\n"]}
+{"version":3,"sources":["../src/common/kde.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;AAEH,iCAA8B;AAC9B,yCAAsC;AAItC,wCAAwC;AACjC,MAAM,QAAQ,GAAW,CAAC,CAAS,EAAE,EAAE;IAC5C,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9C,OAAO,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7C,CAAC,CAAC;AAHW,QAAA,QAAQ,YAGnB;AAEF,4CAA4C;AACrC,MAAM,YAAY,GAAW,CAAC,CAAS,EAAE,EAAE;IAChD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5C,CAAC,CAAC;AAHW,QAAA,YAAY,gBAGvB;AAEF;;;;GAIG;AACH,SAAgB,KAAK,CAAC,CAAS,EAAE,GAAW,EAAE,GAAG,GAAG,CAAC;IACnD,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,EAAE;QACvB,OAAO,CAAC,CAAC;KACV;IACD,OAAO,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC;AALD,sBAKC;AAED,SAAgB,SAAS,CAAC,CAAS,EAAE,GAAW,EAAE,GAAG,GAAG,CAAC;IACvD,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,EAAE;QACvB,OAAO,CAAC,CAAC;KACV;IACD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACtD,OAAO,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC;AAND,8BAMC;AAaD;;GAEG;AACH,SAAS,GAAG,CAAC,MAAgB,EAAE,UAAmC;IAChE,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,EAAE;QACT,OAAO,CAAC,CAAC;KACV;IACD,MAAM,MAAM,GAAG,IAAA,WAAI,EAAC,MAAM,CAAC,CAAC;IAC5B,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1B,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QACtC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC7B,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;KAC/C;IACD,2GAA2G;IAC3G,IAAI,KAAK,KAAK,QAAQ,EAAE;QACtB,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC1B,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;SACtD;QACD,KAAK,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,WAAW,GAAG,MAAM,GAAG,WAAW,CAAC;YAChE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACnD;KACF;IACD,IAAI,KAAK,KAAK,CAAC,EAAE;QACf,OAAO,CAAC,CAAC;KACV;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1B,WAAW,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;KACzB;IACD,MAAM,UAAU,GAAG,UAAU,KAAK,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAA,mBAAQ,EAAC,WAAW,CAAC,GAAG,UAAU,CAAC,GAAG,KAAK,GAAG,WAAW,CAAC;AAC7E,CAAC;AAkBD;;;GAGG;AACH,SAAgB,GAAG,CAAC,IAAc,EAAE,UAAsB,EAAE;IAC1D,MAAM,SAAS,GAAG,OAAO,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC;IACrG,MAAM,UAAU,GAAG,OAAO,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC;IACvF,IAAI,SAAS,KAAK,QAAQ,IAAI,SAAS,KAAK,YAAY,EAAE;QACxD,MAAM,IAAI,UAAU,CAAC,gDAAgD,CAAC,CAAC;KACxE;IACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,UAAU,IAAI,CAAC,EAAE;QACnD,MAAM,IAAI,UAAU,CAAC,6CAA6C,CAAC,CAAC;KACrE;IACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,gBAAQ,CAAC;IAE1C,IAAI,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC;IAC1B,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QAChB,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,OAAO,CAAC,eAAe,IAAI,OAAO,CAAC;QAClD,IAAI,MAAM,KAAK,WAAW,EAAE;YAC1B,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SACzB;aAAM;YACL,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SACrB;KACF;IACD,CAAC,IAAI,UAAU,CAAC;IAEhB,yDAAyD;IACzD,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QAChB,MAAM,SAAS,GAAG,CAAC,CAAoB,EAAE,EAAE;YACzC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBACpB,MAAM,GAAG,GAAa,EAAE,CAAC;gBACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACjC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBACb;gBACD,OAAO,GAAG,CAAC;aACZ;YACD,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QACF,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,EAAE;YAC9B,MAAM,GAAG,GAA+B,EAAE,CAAC;YAC3C,IAAI,CAAC,IAAI,CAAC,EAAE;gBACV,OAAO,GAAG,CAAC;aACZ;YACD,iDAAiD;YACjD,IAAI,GAAG,GAAG,QAAQ,CAAC;YACnB,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,GAAG,GAAG,EAAE;oBACX,GAAG,GAAG,CAAC,CAAC;iBACT;gBACD,IAAI,CAAC,GAAG,GAAG,EAAE;oBACX,GAAG,GAAG,CAAC,CAAC;iBACT;aACF;YACD,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;gBACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;iBAC1B;gBACD,OAAO,GAAG,CAAC;aACZ;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aAC5B;YACD,OAAO,GAAG,CAAC;QACb,CAAC,CAAC;QACF,OAAO;YACL,SAAS,EAAE,CAAC;YACZ,MAAM;YACN,QAAQ,EAAE,SAAgB;YAC1B,YAAY,EAAE,SAAS;SACxB,CAAC;KACH;IAED,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAExB,SAAS,SAAS,CAAC,CAAS;QAC1B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;SAClC;QACD,OAAO,GAAG,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,SAAS,QAAQ,CAAC,CAAoB;QACpC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACpB,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B;YACD,OAAO,GAAG,CAAC;SACZ;QACD,OAAO,SAAS,CAAC,CAAW,CAAC,CAAC;IAChC,CAAC;IAED,OAAO;QACL,SAAS,EAAE,CAAC;QACZ,MAAM;QACN,QAAQ,EAAE,QAAe;QACzB,YAAY,CAAC,CAAS;YACpB,MAAM,GAAG,GAA+B,EAAE,CAAC;YAC3C,IAAI,CAAC,IAAI,CAAC,EAAE;gBACV,OAAO,GAAG,CAAC;aACZ;YACD,qBAAqB;YACrB,IAAI,GAAG,GAAG,QAAQ,CAAC;YACnB,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,GAAG,GAAG,EAAE;oBACX,GAAG,GAAG,CAAC,CAAC;iBACT;gBACD,IAAI,CAAC,GAAG,GAAG,EAAE;oBACX,GAAG,GAAG,CAAC,CAAC;iBACT;aACF;YACD,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;gBACzC,OAAO,GAAG,CAAC;aACZ;YACD,IAAI,GAAG,KAAK,GAAG,EAAE;gBACf,wBAAwB;gBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;iBACzC;gBACD,OAAO,GAAG,CAAC;aACZ;YAED,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;gBAC7C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aAClC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;KACF,CAAC;AACJ,CAAC;AArID,kBAqIC;AAED,kBAAe,GAAG,CAAC","file":"kde.js","sourcesContent":["/**\n * Kernel Density Estimation (KDE) utilities\n *\n * Exports:\n * - Kernel functions: gaussian, epanechnikov\n * - bandwidth selectors: scott, silverman\n * - kde: main function to compute density estimates at provided points\n */\n\nimport { mean } from './mean';\nimport { variance } from './variance';\n\nexport type Kernel = (u: number) => number;\n\n/** Gaussian kernel (standard normal) */\nexport const gaussian: Kernel = (u: number) => {\n  const invSqrt2Pi = 1 / Math.sqrt(2 * Math.PI);\n  return invSqrt2Pi * Math.exp(-0.5 * u * u);\n};\n\n/** Epanechnikov kernel (compact support) */\nexport const epanechnikov: Kernel = (u: number) => {\n  const absu = Math.abs(u);\n  return absu <= 1 ? 0.75 * (1 - u * u) : 0;\n};\n\n/**\n * Bandwidth selectors\n * - scott: h = n^{-1/(d+4)} * std\n * - silverman: h = ( (4/(d+2))^{1/(d+4)} ) * n^{-1/(d+4)} * std\n */\nexport function scott(n: number, std: number, dim = 1) {\n  if (n <= 0 || std === 0) {\n    return 0;\n  }\n  return std * Math.pow(n, -1 / (dim + 4));\n}\n\nexport function silverman(n: number, std: number, dim = 1) {\n  if (n <= 0 || std === 0) {\n    return 0;\n  }\n  const factor = Math.pow(4 / (dim + 2), 1 / (dim + 4));\n  return factor * std * Math.pow(n, -1 / (dim + 4));\n}\n\nexport interface KDEOptions {\n  kernel?: Kernel;\n  bandwidth?: number; // fixed bandwidth\n  bandwidthMethod?: 'scott' | 'silverman';\n  /** Automatic bandwidth uses population deviation by default, preserving existing behavior. */\n  standardDeviation?: 'sample' | 'population';\n  /** Positive multiplier applied once to either fixed or automatic bandwidth. */\n  bandwidthAdjust?: number;\n  // if bandwidth not provided, compute from data using method\n}\n\n/**\n * Compute standard deviation for numeric array\n */\nfunction std(values: number[], convention: 'sample' | 'population') {\n  const n = values.length;\n  if (n < 2) {\n    return 0;\n  }\n  const center = mean(values);\n  const differences: number[] = [];\n  let scale = 0;\n  let sourceScale = 1;\n  for (let i = 0; i < n; i++) {\n    const difference = values[i] - center;\n    differences.push(difference);\n    scale = Math.max(scale, Math.abs(difference));\n  }\n  // Finite values of opposite signs can overflow subtraction although population deviation is representable.\n  if (scale === Infinity) {\n    sourceScale = Math.abs(center);\n    for (const value of values) {\n      sourceScale = Math.max(sourceScale, Math.abs(value));\n    }\n    scale = 0;\n    for (let i = 0; i < n; i++) {\n      differences[i] = values[i] / sourceScale - center / sourceScale;\n      scale = Math.max(scale, Math.abs(differences[i]));\n    }\n  }\n  if (scale === 0) {\n    return 0;\n  }\n  for (let i = 0; i < n; i++) {\n    differences[i] /= scale;\n  }\n  const correction = convention === 'population' ? (n - 1) / n : 1;\n  return Math.sqrt(variance(differences) * correction) * scale * sourceScale;\n}\n\nexport interface KDEEvaluator {\n  bandwidth: number;\n  kernel: Kernel;\n  /**\n   * Evaluate density at a single point or array of points.\n   * - If given a number, returns a number.\n   * - If given an array, returns an array aligned with input.\n   */\n  evaluate: ((x: number) => number) & ((xs: number[]) => number[]);\n  /**\n   * Produce N uniformly spaced points across the data range and evaluate densities.\n   * Returns an array { x: number, y: number }[].\n   */\n  evaluateGrid: (N: number) => { x: number; y: number }[];\n}\n\n/**\n * Factory: create a KDE evaluator for given data and options.\n * Usage: const model = kde(data, options); model.evaluate(x) or model.evaluate([x1,x2])\n */\nexport function kde(data: number[], options: KDEOptions = {}): KDEEvaluator {\n  const deviation = options.standardDeviation === undefined ? 'population' : options.standardDeviation;\n  const adjustment = options.bandwidthAdjust === undefined ? 1 : options.bandwidthAdjust;\n  if (deviation !== 'sample' && deviation !== 'population') {\n    throw new RangeError('standardDeviation must be sample or population');\n  }\n  if (!Number.isFinite(adjustment) || adjustment <= 0) {\n    throw new RangeError('bandwidthAdjust must be finite and positive');\n  }\n  const n = data.length;\n  const kernel = options.kernel || gaussian;\n\n  let h = options.bandwidth;\n  if (!h || h <= 0) {\n    const sd = std(data, deviation) || 0;\n    const method = options.bandwidthMethod || 'scott';\n    if (method === 'silverman') {\n      h = silverman(n, sd, 1);\n    } else {\n      h = scott(n, sd, 1);\n    }\n  }\n  h *= adjustment;\n\n  // if still zero (constant data), evaluator returns zeros\n  if (!h || h <= 0) {\n    const zerosEval = (x: number | number[]) => {\n      if (Array.isArray(x)) {\n        const out: number[] = [];\n        for (let i = 0; i < x.length; i++) {\n          out.push(0);\n        }\n        return out;\n      }\n      return 0;\n    };\n    const zerosGrid = (N: number) => {\n      const out: { x: number; y: number }[] = [];\n      if (N <= 0) {\n        return out;\n      }\n      // compute data min (use data range if available)\n      let min = Infinity;\n      let max = -Infinity;\n      for (let j = 0; j < n; j++) {\n        const v = data[j];\n        if (v < min) {\n          min = v;\n        }\n        if (v > max) {\n          max = v;\n        }\n      }\n      if (min === Infinity || max === -Infinity) {\n        for (let i = 0; i < N; i++) {\n          out.push({ x: 0, y: 0 });\n        }\n        return out;\n      }\n      for (let i = 0; i < N; i++) {\n        out.push({ x: min, y: 0 });\n      }\n      return out;\n    };\n    return {\n      bandwidth: 0,\n      kernel,\n      evaluate: zerosEval as any,\n      evaluateGrid: zerosGrid\n    };\n  }\n\n  const invNh = 1 / n / h;\n\n  function evalPoint(x: number) {\n    let sum = 0;\n    for (let j = 0; j < n; j++) {\n      sum += kernel((x - data[j]) / h);\n    }\n    return sum * invNh;\n  }\n\n  function evaluate(x: number | number[]) {\n    if (Array.isArray(x)) {\n      const out: number[] = [];\n      for (let i = 0; i < x.length; i++) {\n        out.push(evalPoint(x[i]));\n      }\n      return out;\n    }\n    return evalPoint(x as number);\n  }\n\n  return {\n    bandwidth: h,\n    kernel,\n    evaluate: evaluate as any,\n    evaluateGrid(N: number) {\n      const out: { x: number; y: number }[] = [];\n      if (N <= 0) {\n        return out;\n      }\n      // compute data range\n      let min = Infinity;\n      let max = -Infinity;\n      for (let i = 0; i < n; i++) {\n        const v = data[i];\n        if (v < min) {\n          min = v;\n        }\n        if (v > max) {\n          max = v;\n        }\n      }\n      if (min === Infinity || max === -Infinity) {\n        return out;\n      }\n      if (min === max) {\n        // single point repeated\n        for (let i = 0; i < N; i++) {\n          out.push({ x: min, y: evalPoint(min) });\n        }\n        return out;\n      }\n\n      const step = (max - min) / (N - 1);\n      for (let i = 0; i < N; i++) {\n        const x = i === N - 1 ? max : min + step * i;\n        out.push({ x, y: evalPoint(x) });\n      }\n      return out;\n    }\n  };\n}\n\nexport default kde;\n"]}

package/cjs/common/regression-lowess.d.ts

@@ -1,5 +1,5 @@
 /**
- * 局部线性 LOWESS。默认全量观测、span=2/3、三次稳健重加权。
+ * 局部线性 LOWESS。默认全量观测，保留历史参数 span=0.3、iterations=2。
  * delta 显式插值加速；maxSamples 仅保留显式选择的历史抽样用途。
  * predict 与 evaluateGrid 查询构建时固定的同一模型，不触发再拟合。
  */

package/cjs/common/regression-lowess.js

@@ -7,13 +7,13 @@ Object.defineProperty(exports, "__esModule", {
 const regression_solver_1 = require("./regression-solver"), median_1 = require("./median"), regression_utils_1 = require("./regression-utils");
 
 /**
- * 局部线性 LOWESS。默认全量观测、span=2/3、三次稳健重加权。
+ * 局部线性 LOWESS。默认全量观测，保留历史参数 span=0.3、iterations=2。
  * delta 显式插值加速；maxSamples 仅保留显式选择的历史抽样用途。
  * predict 与 evaluateGrid 查询构建时固定的同一模型，不触发再拟合。
  */
 function regressionLowess(data, x = (d => d.x), y = (d => d.y), options = {}) {
     var _a, _b, _c, _d, _e;
-    const span = null !== (_a = options.span) && void 0 !== _a ? _a : 2 / 3, degree = null !== (_b = options.degree) && void 0 !== _b ? _b : 1, iterations = null !== (_c = options.iterations) && void 0 !== _c ? _c : 3, delta = null !== (_d = options.delta) && void 0 !== _d ? _d : 0, alpha = null !== (_e = options.alpha) && void 0 !== _e ? _e : .05;
+    const span = null !== (_a = options.span) && void 0 !== _a ? _a : .3, degree = null !== (_b = options.degree) && void 0 !== _b ? _b : 1, iterations = null !== (_c = options.iterations) && void 0 !== _c ? _c : 2, delta = null !== (_d = options.delta) && void 0 !== _d ? _d : 0, alpha = null !== (_e = options.alpha) && void 0 !== _e ? _e : .05;
     if (!(span > 0 && span <= 1) || !Number.isInteger(iterations) || iterations < 0 || !Number.isFinite(delta) || delta < 0 || 0 !== degree && 1 !== degree || null != options.maxSamples && (!Number.isInteger(options.maxSamples) || options.maxSamples < 2)) throw new RangeError("Invalid LOWESS span, degree, iterations, delta or maxSamples");
     let pts = (0, regression_solver_1.regressionPoints)(data, x, y).sort(((a, b) => a.x - b.x || a.y - b.y));
     if (null != options.maxSamples && pts.length > options.maxSamples) {

package/cjs/common/regression-lowess.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/regression-lowess.ts"],"names":[],"mappings":";;;AAAA,2DAA6G;AAC7G,qCAAkC;AAClC,yDAK4B;AAE5B;;;;GAIG;AACH,SAAgB,gBAAgB,CAC9B,IAAW,EACX,IAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAChC,IAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAChC,UAOI,EAAE;;IAEN,MAAM,IAAI,GAAG,MAAA,OAAO,CAAC,IAAI,mCAAI,CAAC,GAAG,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,MAAA,OAAO,CAAC,MAAM,mCAAI,CAAC,CAAC;IACnC,MAAM,UAAU,GAAG,MAAA,OAAO,CAAC,UAAU,mCAAI,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,MAAA,OAAO,CAAC,KAAK,mCAAI,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,MAAA,OAAO,CAAC,KAAK,mCAAI,IAAI,CAAC;IACpC,IACE,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;QACxB,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC;QAC7B,UAAU,GAAG,CAAC;QACd,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QACvB,KAAK,GAAG,CAAC;QACT,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,CAAC;QAC9B,CAAC,OAAO,CAAC,UAAU,IAAI,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,EACjG;QACA,MAAM,IAAI,UAAU,CAAC,8DAA8D,CAAC,CAAC;KACtF;IACD,IAAI,GAAG,GAAG,IAAA,oCAAgB,EAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,IAAI,OAAO,CAAC,UAAU,IAAI,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE;QACjE,MAAM,IAAI,GAAG,GAAG,CAAC;QACjB,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC;QACjC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACxG;IACD,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IACrB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAA,mCAAe,EAAC,GAAG,CAAC,CAAC;IACnC,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAA,uCAAmB,EAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACvF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAA,uCAAmB,EAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACvF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACrE,IAAI,aAAmC,CAAC;IAExC,SAAS,KAAK,CAAC,EAAU;QACvB,IAAI,CAAC,CAAC,EAAE;YACN,OAAO,CAAC,CAAC;SACV;QACD,MAAM,KAAK,GAAG,IAAA,uCAAmB,EAAC,EAAE,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACnE,wCAAwC;QACxC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,OAAO,IAAI,GAAG,KAAK,EAAE;YACnB,MAAM,GAAG,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,aAAa,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACrC,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAC7C,IACE,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC;gBAC9D,CAAC,CAAC,aAAa,GAAG,aAAa;gBAC/B,CAAC,CAAC,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,KAAK,EAC/D;gBACA,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;aAChB;iBAAM;gBACL,KAAK,GAAG,GAAG,CAAC;aACb;SACF;QACD,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,GAAG,GAAG,IAAI,GAAG,KAAK,CAAC;QACvB,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE;YACjC,OAAO,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE;gBACnD,KAAK,EAAE,CAAC;aACT;YACD,OAAO,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE;gBAC3C,GAAG,EAAE,CAAC;aACP;SACF;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACrF,MAAM,MAAM,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3C,MAAM,MAAM,GAAG,MAAM;YACnB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YACxF,CAAC,CAAC,SAAS,CAAC;QACd,6BAA6B;QAC7B,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAChC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;SAChC;QACD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,OAAO,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC;QACjF,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAChC,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;YACvF,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACrC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,EAAE,IAAI,CAAC,CAAC;YACR,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YACZ,MAAM,QAAQ,GAAG,IAAA,uCAAmB,EAAC,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;YAC/D,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC;YACnB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;SACzB;QACD,IAAI,EAAE,KAAK,CAAC,EAAE;YACZ,+BAA+B;YAC/B,IAAI,QAAQ,GAAG,QAAQ,CAAC;YACxB,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,IAAI,CAAC,KAAK,CAAC,EAAE;oBACX,SAAS;iBACV;gBACD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;gBACnE,IAAI,CAAC,GAAG,QAAQ,EAAE;oBAChB,QAAQ,GAAG,CAAC,CAAC;oBACb,MAAM,GAAG,CAAC,CAAC;oBACX,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;iBACjB;qBAAM,IAAI,CAAC,KAAK,QAAQ,EAAE;oBACzB,KAAK,GAAG,KAAK,GAAG,CAAC,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;oBACvE,MAAM,IAAI,CAAC,CAAC;iBACb;aACF;YACD,IAAI,MAAM,KAAK,CAAC,EAAE;gBAChB,MAAM,IAAI,UAAU,CAAC,4CAA4C,CAAC,CAAC;aACpE;YACD,OAAO,KAAK,CAAC;SACd;QACD,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,QAAQ,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,IAAI,QAAQ,IAAI,MAAM,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC;QACpG,OAAO,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,qCAAqC;IACrC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAI;QACvB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;YACf,MAAM;SACP;QACD,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,KAAK,GAAG,CAAC,EAAE;YACb,OAAO,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE;gBACxD,IAAI,EAAE,CAAC;aACR;SACF;QACD,wBAAwB;QACxB,OAAO,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,EAAE;YACpD,IAAI,EAAE,CAAC;SACR;QACD,CAAC,GAAG,IAAI,CAAC;KACV;IACD,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IAChC,SAAS,eAAe;QACtB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK,CAAC,EAAE;gBACX,SAAS;aACV;YACD,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;YAChG,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;gBACzC,MAAM,CAAC,GACL,KAAK,KAAK,CAAC;oBACT,CAAC,CAAC,CAAC;oBACH,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC,GAAG,KAAK,CAAC;gBAC9G,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;aACnD;SACF;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,IAAI,UAAU,EAAE,SAAS,EAAE,EAAE;QAC5D,IAAI,GAAG,eAAe,EAAE,CAAC;QACzB,IAAI,SAAS,KAAK,UAAU,EAAE;YAC5B,MAAM;SACP;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC7B,OAAO,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC;gBAC9B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;gBACnC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAA,uCAAmB,EAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACrF,CAAC,CAAC,CAAC;QACH,MAAM,GAAG,GAAG,IAAA,eAAM,EAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;QACtC,MAAM,WAAW,GAAG,IAAI,CAAC;QACzB,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACrC,IAAI,GAAG,KAAK,CAAC,EAAE;gBACb,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC/G,OAAO,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC/B;YACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YACxB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;KACJ;IACD,SAAS,aAAa,CAAC,EAAU;QAC/B,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;YAC5D,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC;SAClB;QACD,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACf,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE;YAClB,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE;gBACnB,EAAE,GAAG,GAAG,CAAC;aACV;iBAAM;gBACL,EAAE,GAAG,GAAG,CAAC;aACV;SACF;QACD,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE;YACzB,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC;SACjB;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;YAC9B,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK;YACzB,CAAC,CAAC,CAAC,IAAA,uCAAmB,EAAC,EAAE,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;QACnH,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC3C,CAAC;IACD,SAAS,OAAO,CAAC,EAAqB;QACpC,OAAO,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;IACvE,CAAC;IACD,SAAS,YAAY,CAAC,CAAS;QAC7B,OAAO,IAAA,kCAAc,EAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IAChE,CAAC;IAED,SAAS,kBAAkB,CAAC,IAAY,EAAE;QACxC,MAAM,GAAG,GAAsG,EAAE,CAAC;QAElH,IAAI,CAAC,IAAI,CAAC,EAAE;YACV,OAAO,GAAG,CAAC;SACZ;QACD,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,OAAO,GAAG,CAAC;SACZ;QAED,oCAAoC;QACpC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAExB,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;YACnF,OAAO,GAAG,CAAC;SACZ;QAED,MAAM,KAAK,GAAG,IAAA,4CAAyB,EAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAU,EAAE,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;QACvF,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE;YACjB,OAAO,GAAG,CAAC;SACZ;QAED,MAAM,CAAC,GAAG,IAAA,0CAAuB,EAAC,KAAK,CAAC,CAAC;QACzC,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE;YAC3B,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACnC,MAAM,IAAI,GAAG,IAAA,8BAAW,EAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC3C,MAAM,aAAa,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,MAAM,aAAa,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,GAAG,CAAC,IAAI,CAAC;oBACP,CAAC,EAAE,KAAK,CAAC,GAAG;oBACZ,IAAI,EAAE,CAAC;oBACP,KAAK,EAAE,CAAC,GAAG,aAAa;oBACxB,KAAK,EAAE,CAAC,GAAG,aAAa;oBACxB,SAAS,EAAE,CAAC,GAAG,aAAa;oBAC5B,SAAS,EAAE,CAAC,GAAG,aAAa;iBAC7B,CAAC,CAAC;aACJ;YACD,OAAO,GAAG,CAAC;SACZ;QAED,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;YAC9C,MAAM,EAAE,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAA,8BAAW,EAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACpC,MAAM,aAAa,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,MAAM,aAAa,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,GAAG,CAAC,IAAI,CAAC;gBACP,CAAC,EAAE,EAAE;gBACL,IAAI,EAAE,EAAE;gBACR,KAAK,EAAE,EAAE,GAAG,aAAa;gBACzB,KAAK,EAAE,EAAE,GAAG,aAAa;gBACzB,SAAS,EAAE,EAAE,GAAG,aAAa;gBAC7B,SAAS,EAAE,EAAE,GAAG,aAAa;aAC9B,CAAC,CAAC;SACJ;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO;QACL,OAAO;QACP,QAAQ,EAAE,OAAO;QACjB,YAAY;QACZ,kBAAkB;QAClB,0BAA0B;QAC1B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KACpD,CAAC;AACJ,CAAC;AA7SD,4CA6SC;AACD,kBAAe,gBAAgB,CAAC","file":"regression-lowess.js","sourcesContent":["import { regressionPoints, regressionGrid, regressionBasis, normalizeRegression } from './regression-solver';\nimport { median } from './median';\nimport {\n  computeLinearCIComponents,\n  confidenceCriticalValue,\n  confidenceHalfWidth,\n  stdErrorsAt\n} from './regression-utils';\n\n/**\n * 局部线性 LOWESS。默认全量观测、span=2/3、三次稳健重加权。\n * delta 显式插值加速；maxSamples 仅保留显式选择的历史抽样用途。\n * predict 与 evaluateGrid 查询构建时固定的同一模型，不触发再拟合。\n */\nexport function regressionLowess(\n  data: any[],\n  x: (d: any) => number = d => d.x,\n  y: (d: any) => number = d => d.y,\n  options: {\n    span?: number;\n    degree?: 1 | 0;\n    iterations?: number;\n    alpha?: number;\n    maxSamples?: number;\n    delta?: number;\n  } = {}\n) {\n  const span = options.span ?? 2 / 3;\n  const degree = options.degree ?? 1;\n  const iterations = options.iterations ?? 3;\n  const delta = options.delta ?? 0;\n  const alpha = options.alpha ?? 0.05;\n  if (\n    !(span > 0 && span <= 1) ||\n    !Number.isInteger(iterations) ||\n    iterations < 0 ||\n    !Number.isFinite(delta) ||\n    delta < 0 ||\n    (degree !== 0 && degree !== 1) ||\n    (options.maxSamples != null && (!Number.isInteger(options.maxSamples) || options.maxSamples < 2))\n  ) {\n    throw new RangeError('Invalid LOWESS span, degree, iterations, delta or maxSamples');\n  }\n  let pts = regressionPoints(data, x, y).sort((a, b) => a.x - b.x || a.y - b.y);\n  if (options.maxSamples != null && pts.length > options.maxSamples) {\n    const full = pts;\n    const count = options.maxSamples;\n    pts = Array.from({ length: count }, (_, i) => full[Math.floor((i * (full.length - 1)) / (count - 1))]);\n  }\n  const n = pts.length;\n  const ptsX = pts.map(p => p.x);\n  const ptsY = pts.map(p => p.y);\n  const basis = regressionBasis(pts);\n  const normalizedX = ptsX.map(v => normalizeRegression(v, basis.xCenter, basis.xScale));\n  const normalizedY = ptsY.map(v => normalizeRegression(v, basis.yCenter, basis.yScale));\n  const count = Math.min(n, Math.max(2, Math.floor(span * n + 1e-10)));\n  let robustWeights: number[] | undefined;\n\n  function exact(x0: number) {\n    if (!n) {\n      return 0;\n    }\n    const query = normalizeRegression(x0, basis.xCenter, basis.xScale);\n    // 找到连续的最近邻窗口；相等距离选择较小的 x（ties 的 y 已排序）。\n    let left = 0;\n    let right = n - count;\n    while (left < right) {\n      const mid = (left + right) >>> 1;\n      const lowerDistance = x0 - ptsX[mid];\n      const upperDistance = ptsX[mid + count] - x0;\n      if (\n        Number.isFinite(lowerDistance) && Number.isFinite(upperDistance)\n          ? lowerDistance > upperDistance\n          : query - normalizedX[mid] > normalizedX[mid + count] - query\n      ) {\n        left = mid + 1;\n      } else {\n        right = mid;\n      }\n    }\n    let start = left;\n    let end = left + count;\n    if (ptsX[start] === ptsX[end - 1]) {\n      while (start > 0 && ptsX[start - 1] === ptsX[start]) {\n        start--;\n      }\n      while (end < n && ptsX[end] === ptsX[start]) {\n        end++;\n      }\n    }\n    const rawRadius = Math.max(Math.abs(ptsX[start] - x0), Math.abs(ptsX[end - 1] - x0));\n    const scaled = !Number.isFinite(rawRadius);\n    const radius = scaled\n      ? Math.max(Math.abs(normalizedX[start] - query), Math.abs(normalizedX[end - 1] - query))\n      : rawRadius;\n    // 局部响应坐标不能由远处、未参与该邻域的观测决定精度。\n    let yMin = Infinity;\n    let yMax = -Infinity;\n    for (let i = start; i < end; i++) {\n      yMin = Math.min(yMin, ptsY[i]);\n      yMax = Math.max(yMax, ptsY[i]);\n    }\n    const yCenter = yMin / 2 + yMax / 2;\n    const yScale = Math.max(Math.abs(yMin - yCenter), Math.abs(yMax - yCenter)) || 1;\n    let sw = 0;\n    let sx = 0;\n    let sy = 0;\n    let sxx = 0;\n    let sxy = 0;\n    for (let i = start; i < end; i++) {\n      const z = radius === 0 ? 0 : (scaled ? normalizedX[i] - query : ptsX[i] - x0) / radius;\n      const u = Math.abs(z);\n      const t = u >= 1 ? 0 : 1 - u * u * u;\n      const w = t * t * t * (robustWeights ? robustWeights[i] : 1);\n      sw += w;\n      sx += w * z;\n      const response = normalizeRegression(ptsY[i], yCenter, yScale);\n      sy += w * response;\n      sxx += w * z * z;\n      sxy += w * z * response;\n    }\n    if (sw === 0) {\n      // 核边界零权重时使用最近有效观测的加权常数；等距离取均值。\n      let distance = Infinity;\n      let weight = 0;\n      let value = 0;\n      for (let i = 0; i < n; i++) {\n        const w = robustWeights ? robustWeights[i] : 1;\n        if (w === 0) {\n          continue;\n        }\n        const d = Math.abs(scaled ? normalizedX[i] - query : ptsX[i] - x0);\n        if (d < distance) {\n          distance = d;\n          weight = w;\n          value = ptsY[i];\n        } else if (d === distance) {\n          value = value * (weight / (weight + w)) + ptsY[i] * (w / (weight + w));\n          weight += w;\n        }\n      }\n      if (weight === 0) {\n        throw new RangeError('LOWESS has no effective local observations');\n      }\n      return value;\n    }\n    const mx = sx / sw;\n    const my = sy / sw;\n    const variance = sxx / sw - mx * mx;\n    const slope = degree === 0 || variance <= Number.EPSILON * 32 ? 0 : (sxy / sw - mx * my) / variance;\n    return yCenter + yScale * (my - slope * mx);\n  }\n\n  // delta 不删除观测。只减少局部回归求值位置，全部残差参与重加权。\n  const anchors: number[] = [];\n  for (let i = 0; i < n; ) {\n    anchors.push(i);\n    if (i === n - 1) {\n      break;\n    }\n    let next = i + 1;\n    if (delta > 0) {\n      while (next + 1 < n && ptsX[next + 1] - ptsX[i] <= delta) {\n        next++;\n      }\n    }\n    // 重复 x 一起使用同一预测；端点不能丢失。\n    while (next + 1 < n && ptsX[next + 1] === ptsX[next]) {\n      next++;\n    }\n    i = next;\n  }\n  let fits = new Array<number>(n);\n  function fitObservations() {\n    const out = new Array<number>(n);\n    for (let a = 0; a < anchors.length; a++) {\n      const index = anchors[a];\n      out[index] = exact(ptsX[index]);\n      if (a === 0) {\n        continue;\n      }\n      const previous = anchors[a - 1];\n      const rawWidth = ptsX[index] - ptsX[previous];\n      const width = Number.isFinite(rawWidth) ? rawWidth : normalizedX[index] - normalizedX[previous];\n      for (let i = previous + 1; i < index; i++) {\n        const t =\n          width === 0\n            ? 0\n            : (Number.isFinite(rawWidth) ? ptsX[i] - ptsX[previous] : normalizedX[i] - normalizedX[previous]) / width;\n        out[i] = out[previous] * (1 - t) + out[index] * t;\n      }\n    }\n    return out;\n  }\n  for (let iteration = 0; iteration <= iterations; iteration++) {\n    fits = fitObservations();\n    if (iteration === iterations) {\n      break;\n    }\n    const residuals = fits.map((v, i) => {\n      const residual = ptsY[i] - v;\n      return Number.isFinite(residual)\n        ? Math.abs(residual / basis.yScale)\n        : Math.abs(normalizedY[i] - normalizeRegression(v, basis.yCenter, basis.yScale));\n    });\n    const med = median(residuals.slice());\n    const currentFits = fits;\n    robustWeights = residuals.map((r, i) => {\n      if (med === 0) {\n        const tolerance = Number.EPSILON * 64 * (Math.max(Math.abs(ptsY[i]), Math.abs(currentFits[i])) / basis.yScale);\n        return r <= tolerance ? 1 : 0;\n      }\n      const u = r / (6 * med);\n      return u >= 1 ? 0 : (1 - u * u) ** 2;\n    });\n  }\n  function predictSingle(x0: number): number {\n    if (delta === 0 || n < 2 || x0 < ptsX[0] || x0 > ptsX[n - 1]) {\n      return exact(x0);\n    }\n    let lo = 0;\n    let hi = n - 1;\n    while (hi - lo > 1) {\n      const mid = (lo + hi) >>> 1;\n      if (ptsX[mid] <= x0) {\n        lo = mid;\n      } else {\n        hi = mid;\n      }\n    }\n    if (ptsX[hi] === ptsX[lo]) {\n      return fits[lo];\n    }\n    const width = ptsX[hi] - ptsX[lo];\n    const t = Number.isFinite(width)\n      ? (x0 - ptsX[lo]) / width\n      : (normalizeRegression(x0, basis.xCenter, basis.xScale) - normalizedX[lo]) / (normalizedX[hi] - normalizedX[lo]);\n    return fits[lo] * (1 - t) + fits[hi] * t;\n  }\n  function predict(x0: number | number[]) {\n    return Array.isArray(x0) ? x0.map(predictSingle) : predictSingle(x0);\n  }\n  function evaluateGrid(N: number) {\n    return regressionGrid(ptsX[0], ptsX[n - 1], N, predictSingle);\n  }\n\n  function confidenceInterval(N: number = 50) {\n    const out: { x: number; mean: number; lower: number; upper: number; predLower: number; predUpper: number }[] = [];\n\n    if (N <= 0) {\n      return out;\n    }\n    if (n === 0) {\n      return out;\n    }\n\n    // use data x-range (already sorted)\n    const min = ptsX[0];\n    const max = ptsX[n - 1];\n\n    if (min === undefined || max === undefined || min === Infinity || max === -Infinity) {\n      return out;\n    }\n\n    const comps = computeLinearCIComponents(data, x, y, (xx: number) => predictSingle(xx));\n    if (comps.n === 0) {\n      return out;\n    }\n\n    const z = confidenceCriticalValue(alpha);\n    if (comps.min === comps.max) {\n      const v = predictSingle(comps.min);\n      const errs = stdErrorsAt(comps.min, comps);\n      const meanHalfWidth = confidenceHalfWidth(z, errs.seMean);\n      const predHalfWidth = confidenceHalfWidth(z, errs.sePred);\n      for (let i = 0; i < N; i++) {\n        out.push({\n          x: comps.min,\n          mean: v,\n          lower: v - meanHalfWidth,\n          upper: v + meanHalfWidth,\n          predLower: v - predHalfWidth,\n          predUpper: v + predHalfWidth\n        });\n      }\n      return out;\n    }\n\n    const step = (max - min) / (N - 1);\n    for (let i = 0; i < N; i++) {\n      const px = i === N - 1 ? max : min + step * i;\n      const yh = predictSingle(px);\n      const errs = stdErrorsAt(px, comps);\n      const meanHalfWidth = confidenceHalfWidth(z, errs.seMean);\n      const predHalfWidth = confidenceHalfWidth(z, errs.sePred);\n      out.push({\n        x: px,\n        mean: yh,\n        lower: yh - meanHalfWidth,\n        upper: yh + meanHalfWidth,\n        predLower: yh - predHalfWidth,\n        predUpper: yh + predHalfWidth\n      });\n    }\n    return out;\n  }\n\n  return {\n    predict,\n    evaluate: predict,\n    evaluateGrid,\n    confidenceInterval,\n    // 节点值按 x 排序，重复观测仍保持其统计权重。\n    fitted: pts.map((p, i) => ({ x: p.x, y: fits[i] }))\n  };\n}\nexport default regressionLowess;\n"]}
+{"version":3,"sources":["../src/common/regression-lowess.ts"],"names":[],"mappings":";;;AAAA,2DAA6G;AAC7G,qCAAkC;AAClC,yDAK4B;AAE5B;;;;GAIG;AACH,SAAgB,gBAAgB,CAC9B,IAAW,EACX,IAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAChC,IAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAChC,UAOI,EAAE;;IAEN,MAAM,IAAI,GAAG,MAAA,OAAO,CAAC,IAAI,mCAAI,GAAG,CAAC;IACjC,MAAM,MAAM,GAAG,MAAA,OAAO,CAAC,MAAM,mCAAI,CAAC,CAAC;IACnC,MAAM,UAAU,GAAG,MAAA,OAAO,CAAC,UAAU,mCAAI,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,MAAA,OAAO,CAAC,KAAK,mCAAI,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,MAAA,OAAO,CAAC,KAAK,mCAAI,IAAI,CAAC;IACpC,IACE,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC;QACxB,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC;QAC7B,UAAU,GAAG,CAAC;QACd,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QACvB,KAAK,GAAG,CAAC;QACT,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,CAAC;QAC9B,CAAC,OAAO,CAAC,UAAU,IAAI,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,EACjG;QACA,MAAM,IAAI,UAAU,CAAC,8DAA8D,CAAC,CAAC;KACtF;IACD,IAAI,GAAG,GAAG,IAAA,oCAAgB,EAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9E,IAAI,OAAO,CAAC,UAAU,IAAI,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE;QACjE,MAAM,IAAI,GAAG,GAAG,CAAC;QACjB,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC;QACjC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACxG;IACD,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IACrB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAA,mCAAe,EAAC,GAAG,CAAC,CAAC;IACnC,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAA,uCAAmB,EAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACvF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAA,uCAAmB,EAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACvF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACrE,IAAI,aAAmC,CAAC;IAExC,SAAS,KAAK,CAAC,EAAU;QACvB,IAAI,CAAC,CAAC,EAAE;YACN,OAAO,CAAC,CAAC;SACV;QACD,MAAM,KAAK,GAAG,IAAA,uCAAmB,EAAC,EAAE,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACnE,wCAAwC;QACxC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,OAAO,IAAI,GAAG,KAAK,EAAE;YACnB,MAAM,GAAG,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,aAAa,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACrC,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAC7C,IACE,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC;gBAC9D,CAAC,CAAC,aAAa,GAAG,aAAa;gBAC/B,CAAC,CAAC,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,KAAK,EAC/D;gBACA,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;aAChB;iBAAM;gBACL,KAAK,GAAG,GAAG,CAAC;aACb;SACF;QACD,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,GAAG,GAAG,IAAI,GAAG,KAAK,CAAC;QACvB,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE;YACjC,OAAO,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE;gBACnD,KAAK,EAAE,CAAC;aACT;YACD,OAAO,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE;gBAC3C,GAAG,EAAE,CAAC;aACP;SACF;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACrF,MAAM,MAAM,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC3C,MAAM,MAAM,GAAG,MAAM;YACnB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YACxF,CAAC,CAAC,SAAS,CAAC;QACd,6BAA6B;QAC7B,IAAI,IAAI,GAAG,QAAQ,CAAC;QACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAChC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;SAChC;QACD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,OAAO,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC;QACjF,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAChC,MAAM,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC;YACvF,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACrC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7D,EAAE,IAAI,CAAC,CAAC;YACR,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YACZ,MAAM,QAAQ,GAAG,IAAA,uCAAmB,EAAC,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;YAC/D,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC;YACnB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;SACzB;QACD,IAAI,EAAE,KAAK,CAAC,EAAE;YACZ,+BAA+B;YAC/B,IAAI,QAAQ,GAAG,QAAQ,CAAC;YACxB,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,IAAI,CAAC,KAAK,CAAC,EAAE;oBACX,SAAS;iBACV;gBACD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;gBACnE,IAAI,CAAC,GAAG,QAAQ,EAAE;oBAChB,QAAQ,GAAG,CAAC,CAAC;oBACb,MAAM,GAAG,CAAC,CAAC;oBACX,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;iBACjB;qBAAM,IAAI,CAAC,KAAK,QAAQ,EAAE;oBACzB,KAAK,GAAG,KAAK,GAAG,CAAC,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;oBACvE,MAAM,IAAI,CAAC,CAAC;iBACb;aACF;YACD,IAAI,MAAM,KAAK,CAAC,EAAE;gBAChB,MAAM,IAAI,UAAU,CAAC,4CAA4C,CAAC,CAAC;aACpE;YACD,OAAO,KAAK,CAAC;SACd;QACD,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,QAAQ,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,IAAI,QAAQ,IAAI,MAAM,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC;QACpG,OAAO,OAAO,GAAG,MAAM,GAAG,CAAC,EAAE,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,qCAAqC;IACrC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAI;QACvB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;YACf,MAAM;SACP;QACD,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,KAAK,GAAG,CAAC,EAAE;YACb,OAAO,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE;gBACxD,IAAI,EAAE,CAAC;aACR;SACF;QACD,wBAAwB;QACxB,OAAO,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,EAAE;YACpD,IAAI,EAAE,CAAC;SACR;QACD,CAAC,GAAG,IAAI,CAAC;KACV;IACD,IAAI,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IAChC,SAAS,eAAe;QACtB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK,CAAC,EAAE;gBACX,SAAS;aACV;YACD,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;YAChG,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;gBACzC,MAAM,CAAC,GACL,KAAK,KAAK,CAAC;oBACT,CAAC,CAAC,CAAC;oBACH,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC,GAAG,KAAK,CAAC;gBAC9G,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;aACnD;SACF;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,IAAI,UAAU,EAAE,SAAS,EAAE,EAAE;QAC5D,IAAI,GAAG,eAAe,EAAE,CAAC;QACzB,IAAI,SAAS,KAAK,UAAU,EAAE;YAC5B,MAAM;SACP;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC7B,OAAO,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC;gBAC9B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;gBACnC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAA,uCAAmB,EAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACrF,CAAC,CAAC,CAAC;QACH,MAAM,GAAG,GAAG,IAAA,eAAM,EAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;QACtC,MAAM,WAAW,GAAG,IAAI,CAAC;QACzB,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACrC,IAAI,GAAG,KAAK,CAAC,EAAE;gBACb,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC/G,OAAO,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC/B;YACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YACxB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;KACJ;IACD,SAAS,aAAa,CAAC,EAAU;QAC/B,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;YAC5D,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC;SAClB;QACD,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACf,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE;YAClB,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE;gBACnB,EAAE,GAAG,GAAG,CAAC;aACV;iBAAM;gBACL,EAAE,GAAG,GAAG,CAAC;aACV;SACF;QACD,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE;YACzB,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC;SACjB;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;YAC9B,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK;YACzB,CAAC,CAAC,CAAC,IAAA,uCAAmB,EAAC,EAAE,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;QACnH,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC3C,CAAC;IACD,SAAS,OAAO,CAAC,EAAqB;QACpC,OAAO,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;IACvE,CAAC;IACD,SAAS,YAAY,CAAC,CAAS;QAC7B,OAAO,IAAA,kCAAc,EAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAC;IAChE,CAAC;IAED,SAAS,kBAAkB,CAAC,IAAY,EAAE;QACxC,MAAM,GAAG,GAAsG,EAAE,CAAC;QAElH,IAAI,CAAC,IAAI,CAAC,EAAE;YACV,OAAO,GAAG,CAAC;SACZ;QACD,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,OAAO,GAAG,CAAC;SACZ;QAED,oCAAoC;QACpC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAExB,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;YACnF,OAAO,GAAG,CAAC;SACZ;QAED,MAAM,KAAK,GAAG,IAAA,4CAAyB,EAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAU,EAAE,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;QACvF,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE;YACjB,OAAO,GAAG,CAAC;SACZ;QAED,MAAM,CAAC,GAAG,IAAA,0CAAuB,EAAC,KAAK,CAAC,CAAC;QACzC,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE;YAC3B,MAAM,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACnC,MAAM,IAAI,GAAG,IAAA,8BAAW,EAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC3C,MAAM,aAAa,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,MAAM,aAAa,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,GAAG,CAAC,IAAI,CAAC;oBACP,CAAC,EAAE,KAAK,CAAC,GAAG;oBACZ,IAAI,EAAE,CAAC;oBACP,KAAK,EAAE,CAAC,GAAG,aAAa;oBACxB,KAAK,EAAE,CAAC,GAAG,aAAa;oBACxB,SAAS,EAAE,CAAC,GAAG,aAAa;oBAC5B,SAAS,EAAE,CAAC,GAAG,aAAa;iBAC7B,CAAC,CAAC;aACJ;YACD,OAAO,GAAG,CAAC;SACZ;QAED,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;YAC9C,MAAM,EAAE,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAA,8BAAW,EAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACpC,MAAM,aAAa,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,MAAM,aAAa,GAAG,IAAA,sCAAmB,EAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,GAAG,CAAC,IAAI,CAAC;gBACP,CAAC,EAAE,EAAE;gBACL,IAAI,EAAE,EAAE;gBACR,KAAK,EAAE,EAAE,GAAG,aAAa;gBACzB,KAAK,EAAE,EAAE,GAAG,aAAa;gBACzB,SAAS,EAAE,EAAE,GAAG,aAAa;gBAC7B,SAAS,EAAE,EAAE,GAAG,aAAa;aAC9B,CAAC,CAAC;SACJ;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO;QACL,OAAO;QACP,QAAQ,EAAE,OAAO;QACjB,YAAY;QACZ,kBAAkB;QAClB,0BAA0B;QAC1B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KACpD,CAAC;AACJ,CAAC;AA7SD,4CA6SC;AACD,kBAAe,gBAAgB,CAAC","file":"regression-lowess.js","sourcesContent":["import { regressionPoints, regressionGrid, regressionBasis, normalizeRegression } from './regression-solver';\nimport { median } from './median';\nimport {\n  computeLinearCIComponents,\n  confidenceCriticalValue,\n  confidenceHalfWidth,\n  stdErrorsAt\n} from './regression-utils';\n\n/**\n * 局部线性 LOWESS。默认全量观测，保留历史参数 span=0.3、iterations=2。\n * delta 显式插值加速；maxSamples 仅保留显式选择的历史抽样用途。\n * predict 与 evaluateGrid 查询构建时固定的同一模型，不触发再拟合。\n */\nexport function regressionLowess(\n  data: any[],\n  x: (d: any) => number = d => d.x,\n  y: (d: any) => number = d => d.y,\n  options: {\n    span?: number;\n    degree?: 1 | 0;\n    iterations?: number;\n    alpha?: number;\n    maxSamples?: number;\n    delta?: number;\n  } = {}\n) {\n  const span = options.span ?? 0.3;\n  const degree = options.degree ?? 1;\n  const iterations = options.iterations ?? 2;\n  const delta = options.delta ?? 0;\n  const alpha = options.alpha ?? 0.05;\n  if (\n    !(span > 0 && span <= 1) ||\n    !Number.isInteger(iterations) ||\n    iterations < 0 ||\n    !Number.isFinite(delta) ||\n    delta < 0 ||\n    (degree !== 0 && degree !== 1) ||\n    (options.maxSamples != null && (!Number.isInteger(options.maxSamples) || options.maxSamples < 2))\n  ) {\n    throw new RangeError('Invalid LOWESS span, degree, iterations, delta or maxSamples');\n  }\n  let pts = regressionPoints(data, x, y).sort((a, b) => a.x - b.x || a.y - b.y);\n  if (options.maxSamples != null && pts.length > options.maxSamples) {\n    const full = pts;\n    const count = options.maxSamples;\n    pts = Array.from({ length: count }, (_, i) => full[Math.floor((i * (full.length - 1)) / (count - 1))]);\n  }\n  const n = pts.length;\n  const ptsX = pts.map(p => p.x);\n  const ptsY = pts.map(p => p.y);\n  const basis = regressionBasis(pts);\n  const normalizedX = ptsX.map(v => normalizeRegression(v, basis.xCenter, basis.xScale));\n  const normalizedY = ptsY.map(v => normalizeRegression(v, basis.yCenter, basis.yScale));\n  const count = Math.min(n, Math.max(2, Math.floor(span * n + 1e-10)));\n  let robustWeights: number[] | undefined;\n\n  function exact(x0: number) {\n    if (!n) {\n      return 0;\n    }\n    const query = normalizeRegression(x0, basis.xCenter, basis.xScale);\n    // 找到连续的最近邻窗口；相等距离选择较小的 x（ties 的 y 已排序）。\n    let left = 0;\n    let right = n - count;\n    while (left < right) {\n      const mid = (left + right) >>> 1;\n      const lowerDistance = x0 - ptsX[mid];\n      const upperDistance = ptsX[mid + count] - x0;\n      if (\n        Number.isFinite(lowerDistance) && Number.isFinite(upperDistance)\n          ? lowerDistance > upperDistance\n          : query - normalizedX[mid] > normalizedX[mid + count] - query\n      ) {\n        left = mid + 1;\n      } else {\n        right = mid;\n      }\n    }\n    let start = left;\n    let end = left + count;\n    if (ptsX[start] === ptsX[end - 1]) {\n      while (start > 0 && ptsX[start - 1] === ptsX[start]) {\n        start--;\n      }\n      while (end < n && ptsX[end] === ptsX[start]) {\n        end++;\n      }\n    }\n    const rawRadius = Math.max(Math.abs(ptsX[start] - x0), Math.abs(ptsX[end - 1] - x0));\n    const scaled = !Number.isFinite(rawRadius);\n    const radius = scaled\n      ? Math.max(Math.abs(normalizedX[start] - query), Math.abs(normalizedX[end - 1] - query))\n      : rawRadius;\n    // 局部响应坐标不能由远处、未参与该邻域的观测决定精度。\n    let yMin = Infinity;\n    let yMax = -Infinity;\n    for (let i = start; i < end; i++) {\n      yMin = Math.min(yMin, ptsY[i]);\n      yMax = Math.max(yMax, ptsY[i]);\n    }\n    const yCenter = yMin / 2 + yMax / 2;\n    const yScale = Math.max(Math.abs(yMin - yCenter), Math.abs(yMax - yCenter)) || 1;\n    let sw = 0;\n    let sx = 0;\n    let sy = 0;\n    let sxx = 0;\n    let sxy = 0;\n    for (let i = start; i < end; i++) {\n      const z = radius === 0 ? 0 : (scaled ? normalizedX[i] - query : ptsX[i] - x0) / radius;\n      const u = Math.abs(z);\n      const t = u >= 1 ? 0 : 1 - u * u * u;\n      const w = t * t * t * (robustWeights ? robustWeights[i] : 1);\n      sw += w;\n      sx += w * z;\n      const response = normalizeRegression(ptsY[i], yCenter, yScale);\n      sy += w * response;\n      sxx += w * z * z;\n      sxy += w * z * response;\n    }\n    if (sw === 0) {\n      // 核边界零权重时使用最近有效观测的加权常数；等距离取均值。\n      let distance = Infinity;\n      let weight = 0;\n      let value = 0;\n      for (let i = 0; i < n; i++) {\n        const w = robustWeights ? robustWeights[i] : 1;\n        if (w === 0) {\n          continue;\n        }\n        const d = Math.abs(scaled ? normalizedX[i] - query : ptsX[i] - x0);\n        if (d < distance) {\n          distance = d;\n          weight = w;\n          value = ptsY[i];\n        } else if (d === distance) {\n          value = value * (weight / (weight + w)) + ptsY[i] * (w / (weight + w));\n          weight += w;\n        }\n      }\n      if (weight === 0) {\n        throw new RangeError('LOWESS has no effective local observations');\n      }\n      return value;\n    }\n    const mx = sx / sw;\n    const my = sy / sw;\n    const variance = sxx / sw - mx * mx;\n    const slope = degree === 0 || variance <= Number.EPSILON * 32 ? 0 : (sxy / sw - mx * my) / variance;\n    return yCenter + yScale * (my - slope * mx);\n  }\n\n  // delta 不删除观测。只减少局部回归求值位置，全部残差参与重加权。\n  const anchors: number[] = [];\n  for (let i = 0; i < n; ) {\n    anchors.push(i);\n    if (i === n - 1) {\n      break;\n    }\n    let next = i + 1;\n    if (delta > 0) {\n      while (next + 1 < n && ptsX[next + 1] - ptsX[i] <= delta) {\n        next++;\n      }\n    }\n    // 重复 x 一起使用同一预测；端点不能丢失。\n    while (next + 1 < n && ptsX[next + 1] === ptsX[next]) {\n      next++;\n    }\n    i = next;\n  }\n  let fits = new Array<number>(n);\n  function fitObservations() {\n    const out = new Array<number>(n);\n    for (let a = 0; a < anchors.length; a++) {\n      const index = anchors[a];\n      out[index] = exact(ptsX[index]);\n      if (a === 0) {\n        continue;\n      }\n      const previous = anchors[a - 1];\n      const rawWidth = ptsX[index] - ptsX[previous];\n      const width = Number.isFinite(rawWidth) ? rawWidth : normalizedX[index] - normalizedX[previous];\n      for (let i = previous + 1; i < index; i++) {\n        const t =\n          width === 0\n            ? 0\n            : (Number.isFinite(rawWidth) ? ptsX[i] - ptsX[previous] : normalizedX[i] - normalizedX[previous]) / width;\n        out[i] = out[previous] * (1 - t) + out[index] * t;\n      }\n    }\n    return out;\n  }\n  for (let iteration = 0; iteration <= iterations; iteration++) {\n    fits = fitObservations();\n    if (iteration === iterations) {\n      break;\n    }\n    const residuals = fits.map((v, i) => {\n      const residual = ptsY[i] - v;\n      return Number.isFinite(residual)\n        ? Math.abs(residual / basis.yScale)\n        : Math.abs(normalizedY[i] - normalizeRegression(v, basis.yCenter, basis.yScale));\n    });\n    const med = median(residuals.slice());\n    const currentFits = fits;\n    robustWeights = residuals.map((r, i) => {\n      if (med === 0) {\n        const tolerance = Number.EPSILON * 64 * (Math.max(Math.abs(ptsY[i]), Math.abs(currentFits[i])) / basis.yScale);\n        return r <= tolerance ? 1 : 0;\n      }\n      const u = r / (6 * med);\n      return u >= 1 ? 0 : (1 - u * u) ** 2;\n    });\n  }\n  function predictSingle(x0: number): number {\n    if (delta === 0 || n < 2 || x0 < ptsX[0] || x0 > ptsX[n - 1]) {\n      return exact(x0);\n    }\n    let lo = 0;\n    let hi = n - 1;\n    while (hi - lo > 1) {\n      const mid = (lo + hi) >>> 1;\n      if (ptsX[mid] <= x0) {\n        lo = mid;\n      } else {\n        hi = mid;\n      }\n    }\n    if (ptsX[hi] === ptsX[lo]) {\n      return fits[lo];\n    }\n    const width = ptsX[hi] - ptsX[lo];\n    const t = Number.isFinite(width)\n      ? (x0 - ptsX[lo]) / width\n      : (normalizeRegression(x0, basis.xCenter, basis.xScale) - normalizedX[lo]) / (normalizedX[hi] - normalizedX[lo]);\n    return fits[lo] * (1 - t) + fits[hi] * t;\n  }\n  function predict(x0: number | number[]) {\n    return Array.isArray(x0) ? x0.map(predictSingle) : predictSingle(x0);\n  }\n  function evaluateGrid(N: number) {\n    return regressionGrid(ptsX[0], ptsX[n - 1], N, predictSingle);\n  }\n\n  function confidenceInterval(N: number = 50) {\n    const out: { x: number; mean: number; lower: number; upper: number; predLower: number; predUpper: number }[] = [];\n\n    if (N <= 0) {\n      return out;\n    }\n    if (n === 0) {\n      return out;\n    }\n\n    // use data x-range (already sorted)\n    const min = ptsX[0];\n    const max = ptsX[n - 1];\n\n    if (min === undefined || max === undefined || min === Infinity || max === -Infinity) {\n      return out;\n    }\n\n    const comps = computeLinearCIComponents(data, x, y, (xx: number) => predictSingle(xx));\n    if (comps.n === 0) {\n      return out;\n    }\n\n    const z = confidenceCriticalValue(alpha);\n    if (comps.min === comps.max) {\n      const v = predictSingle(comps.min);\n      const errs = stdErrorsAt(comps.min, comps);\n      const meanHalfWidth = confidenceHalfWidth(z, errs.seMean);\n      const predHalfWidth = confidenceHalfWidth(z, errs.sePred);\n      for (let i = 0; i < N; i++) {\n        out.push({\n          x: comps.min,\n          mean: v,\n          lower: v - meanHalfWidth,\n          upper: v + meanHalfWidth,\n          predLower: v - predHalfWidth,\n          predUpper: v + predHalfWidth\n        });\n      }\n      return out;\n    }\n\n    const step = (max - min) / (N - 1);\n    for (let i = 0; i < N; i++) {\n      const px = i === N - 1 ? max : min + step * i;\n      const yh = predictSingle(px);\n      const errs = stdErrorsAt(px, comps);\n      const meanHalfWidth = confidenceHalfWidth(z, errs.seMean);\n      const predHalfWidth = confidenceHalfWidth(z, errs.sePred);\n      out.push({\n        x: px,\n        mean: yh,\n        lower: yh - meanHalfWidth,\n        upper: yh + meanHalfWidth,\n        predLower: yh - predHalfWidth,\n        predUpper: yh + predHalfWidth\n      });\n    }\n    return out;\n  }\n\n  return {\n    predict,\n    evaluate: predict,\n    evaluateGrid,\n    confidenceInterval,\n    // 节点值按 x 排序，重复观测仍保持其统计权重。\n    fitted: pts.map((p, i) => ({ x: p.x, y: fits[i] }))\n  };\n}\nexport default regressionLowess;\n"]}

package/cjs/data-structure/bounds.js

@@ -236,4 +236,4 @@ class OBBBounds extends Bounds {
 }
 
 exports.OBBBounds = OBBBounds;
-//# sourceMappingURL=bounds.js.map
+//# sourceMappingURL=bounds.js.map

package/cjs/data-structure/hashTable.js

@@ -120,4 +120,5 @@ class HashTable {
     }
 }
 
-exports.HashTable = HashTable;
+exports.HashTable = HashTable;
+//# sourceMappingURL=hashTable.js.map

package/cjs/data-structure/index.js

@@ -23,4 +23,4 @@ __exportStar(require("./hashTable"), exports),
 // Point
 __exportStar(require("./point"), exports), __exportStar(require("./bounds"), exports), 
 __exportStar(require("./matrix"), exports);
-//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/cjs/data-structure/matrix.js

@@ -158,4 +158,4 @@ function normalTransform(out, origin, x, y, scaleX, scaleY, angle, rotateCenter)
 }
 
 exports.Matrix = Matrix, exports.normalTransform = normalTransform;
-//# sourceMappingURL=matrix.js.map
+//# sourceMappingURL=matrix.js.map

package/cjs/data-structure/point.js

@@ -82,4 +82,4 @@ class PolarPoint {
 }
 
 exports.PolarPoint = PolarPoint;
-//# sourceMappingURL=point.js.map
+//# sourceMappingURL=point.js.map

package/dist/index.js

@@ -2778,15 +2778,15 @@
 	}
 
 	/**
-	 * 局部线性 LOWESS。默认全量观测、span=2/3、三次稳健重加权。
+	 * 局部线性 LOWESS。默认全量观测，保留历史参数 span=0.3、iterations=2。
 	 * delta 显式插值加速；maxSamples 仅保留显式选择的历史抽样用途。
 	 * predict 与 evaluateGrid 查询构建时固定的同一模型，不触发再拟合。
 	 */
 	function regressionLowess(data, x = d => d.x, y = d => d.y, options = {}) {
 	    var _a, _b, _c, _d, _e;
-	    const span = (_a = options.span) !== null && _a !== void 0 ? _a : 2 / 3;
+	    const span = (_a = options.span) !== null && _a !== void 0 ? _a : 0.3;
 	    const degree = (_b = options.degree) !== null && _b !== void 0 ? _b : 1;
-	    const iterations = (_c = options.iterations) !== null && _c !== void 0 ? _c : 3;
+	    const iterations = (_c = options.iterations) !== null && _c !== void 0 ? _c : 2;
 	    const delta = (_d = options.delta) !== null && _d !== void 0 ? _d : 0;
 	    const alpha = (_e = options.alpha) !== null && _e !== void 0 ? _e : 0.05;
 	    if (!(span > 0 && span <= 1) ||
@@ -3145,6 +3145,33 @@
 	    };
 	}
 
+	/** 有限数值的均值；空输入没有均值，不修改输入。 */
+	function mean(values) {
+	    if (!values.length) {
+	        return undefined;
+	    }
+	    let scale = 0;
+	    for (const value of values) {
+	        if (!Number.isFinite(value)) {
+	            throw new RangeError('mean requires finite numbers');
+	        }
+	        scale = Math.max(scale, Math.abs(value));
+	    }
+	    if (scale === 0) {
+	        return 0;
+	    }
+	    let sum = 0;
+	    let correction = 0;
+	    for (const value of values) {
+	        const next = value / scale;
+	        const total = sum + next;
+	        // Neumaier compensation retains small contributions even when larger values cancel.
+	        correction += Math.abs(sum) >= Math.abs(next) ? sum - total + next : next - total + sum;
+	        sum = total;
+	    }
+	    return ((sum + correction) / values.length) * scale;
+	}
+
 	/**
 	 * Kernel Density Estimation (KDE) utilities
 	 *
@@ -3184,33 +3211,59 @@
 	/**
 	 * Compute standard deviation for numeric array
 	 */
-	function std(values) {
+	function std(values, convention) {
 	    const n = values.length;
-	    if (n === 0) {
+	    if (n < 2) {
 	        return 0;
 	    }
-	    let mean = 0;
+	    const center = mean(values);
+	    const differences = [];
+	    let scale = 0;
+	    let sourceScale = 1;
 	    for (let i = 0; i < n; i++) {
-	        mean += values[i];
+	        const difference = values[i] - center;
+	        differences.push(difference);
+	        scale = Math.max(scale, Math.abs(difference));
+	    }
+	    // Finite values of opposite signs can overflow subtraction although population deviation is representable.
+	    if (scale === Infinity) {
+	        sourceScale = Math.abs(center);
+	        for (const value of values) {
+	            sourceScale = Math.max(sourceScale, Math.abs(value));
+	        }
+	        scale = 0;
+	        for (let i = 0; i < n; i++) {
+	            differences[i] = values[i] / sourceScale - center / sourceScale;
+	            scale = Math.max(scale, Math.abs(differences[i]));
+	        }
+	    }
+	    if (scale === 0) {
+	        return 0;
 	    }
-	    mean /= n;
-	    let s = 0;
 	    for (let i = 0; i < n; i++) {
-	        const d = values[i] - mean;
-	        s += d * d;
+	        differences[i] /= scale;
 	    }
-	    return Math.sqrt(s / n);
+	    const correction = convention === 'population' ? (n - 1) / n : 1;
+	    return Math.sqrt(variance(differences) * correction) * scale * sourceScale;
 	}
 	/**
 	 * Factory: create a KDE evaluator for given data and options.
 	 * Usage: const model = kde(data, options); model.evaluate(x) or model.evaluate([x1,x2])
 	 */
 	function kde(data, options = {}) {
+	    const deviation = options.standardDeviation === undefined ? 'population' : options.standardDeviation;
+	    const adjustment = options.bandwidthAdjust === undefined ? 1 : options.bandwidthAdjust;
+	    if (deviation !== 'sample' && deviation !== 'population') {
+	        throw new RangeError('standardDeviation must be sample or population');
+	    }
+	    if (!Number.isFinite(adjustment) || adjustment <= 0) {
+	        throw new RangeError('bandwidthAdjust must be finite and positive');
+	    }
 	    const n = data.length;
 	    const kernel = options.kernel || gaussian;
 	    let h = options.bandwidth;
 	    if (!h || h <= 0) {
-	        const sd = std(data) || 0;
+	        const sd = std(data, deviation) || 0;
 	        const method = options.bandwidthMethod || 'scott';
 	        if (method === 'silverman') {
 	            h = silverman(n, sd, 1);
@@ -3219,6 +3272,7 @@
 	            h = scott(n, sd, 1);
 	        }
 	    }
+	    h *= adjustment;
 	    // if still zero (constant data), evaluator returns zeros
 	    if (!h || h <= 0) {
 	        const zerosEval = (x) => {
@@ -3266,7 +3320,7 @@
 	            evaluateGrid: zerosGrid
 	        };
 	    }
-	    const invNh = 1 / (n * h);
+	    const invNh = 1 / n / h;
 	    function evalPoint(x) {
 	        let sum = 0;
 	        for (let j = 0; j < n; j++) {
@@ -3523,33 +3577,6 @@
 	    return method === 'kendall' ? kendall(x, y) : method === 'spearman' ? pearson(ranks(x), ranks(y)) : pearson(x, y);
 	}
 
-	/** 有限数值的均值；空输入没有均值，不修改输入。 */
-	function mean(values) {
-	    if (!values.length) {
-	        return undefined;
-	    }
-	    let scale = 0;
-	    for (const value of values) {
-	        if (!Number.isFinite(value)) {
-	            throw new RangeError('mean requires finite numbers');
-	        }
-	        scale = Math.max(scale, Math.abs(value));
-	    }
-	    if (scale === 0) {
-	        return 0;
-	    }
-	    let sum = 0;
-	    let correction = 0;
-	    for (const value of values) {
-	        const next = value / scale;
-	        const total = sum + next;
-	        // Neumaier compensation retains small contributions even when larger values cancel.
-	        correction += Math.abs(sum) >= Math.abs(next) ? sum - total + next : next - total + sum;
-	        sum = total;
-	    }
-	    return ((sum + correction) / values.length) * scale;
-	}
-
 	/** 有放回重采样；回调不得修改或持有复用的只读样本缓冲区。 */
 	function bootstrapEstimate(values, estimator, options) {
 	    if (!values.length ||