@visactor/vutils 1.0.25 → 1.0.27

package/cjs/common/index.d.ts

@@ -71,3 +71,4 @@ export * from './ecdf';
 export * from './correlation';
 export * from './mean';
 export * from './bootstrap';
+export * from './regression-bootstrap';

package/cjs/common/index.js

@@ -551,5 +551,6 @@ __exportStar(require("./extent"), exports), __exportStar(require("./regression-l
 __exportStar(require("./regression-logistic"), exports), __exportStar(require("./regression-lowess"), exports), 
 __exportStar(require("./regression-polynomial"), exports), __exportStar(require("./kde"), exports), 
 __exportStar(require("./ecdf"), exports), __exportStar(require("./correlation"), exports), 
-__exportStar(require("./mean"), exports), __exportStar(require("./bootstrap"), exports);
+__exportStar(require("./mean"), exports), __exportStar(require("./bootstrap"), exports), 
+__exportStar(require("./regression-bootstrap"), exports);
 //# sourceMappingURL=index.js.map

package/cjs/common/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA,aAAa;AACb,yCAAmD;AAA1C,uHAAA,OAAO,OAAa;AAC7B,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAC9B,iCAA2C;AAAlC,+GAAA,OAAO,OAAS;AACzB,mCAA6C;AAApC,iHAAA,OAAO,OAAU;AAC1B,qCAA+C;AAAtC,mHAAA,OAAO,OAAW;AAC3B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,+CAAyD;AAAhD,6HAAA,OAAO,OAAgB;AAChC,iDAA2D;AAAlD,+HAAA,OAAO,OAAiB;AACjC,mCAA6C;AAApC,iHAAA,OAAO,OAAU;AAC1B,6CAAuD;AAA9C,2HAAA,OAAO,OAAe;AAC/B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,qCAA+C;AAAtC,mHAAA,OAAO,OAAW;AAC3B,6CAAuD;AAA9C,2HAAA,OAAO,OAAe;AAC/B,mCAA6C;AAApC,iHAAA,OAAO,OAAU;AAC1B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,yCAAmD;AAA1C,uHAAA,OAAO,OAAa;AAC7B,iDAA2D;AAAlD,+HAAA,OAAO,OAAiB;AACjC,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAC9B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAE5B,qCAA+C;AAAtC,mHAAA,OAAO,OAAW;AAE3B,SAAS;AACT,6BAAuC;AAA9B,2GAAA,OAAO,OAAO;AACvB,6BAAuC;AAA9B,2GAAA,OAAO,OAAO;AACvB,iCAA2C;AAAlC,+GAAA,OAAO,OAAS;AACzB,yCAAmD;AAA1C,uHAAA,OAAO,OAAa;AAC7B,iCAAsD;AAA7C,+GAAA,OAAO,OAAS;AAAE,kGAAA,SAAS,OAAA;AACpC,+BAAyC;AAAhC,6GAAA,OAAO,OAAQ;AACxB,6CAAuD;AAA9C,2HAAA,OAAO,OAAe;AAC/B,qCAAoC;AAA3B,kGAAA,OAAO,OAAA;AAChB,mDAAkD;AAAzC,gHAAA,cAAc,OAAA;AACvB,0CAAwB;AAExB,QAAQ;AACR,0CAAwB;AACxB,iCAAgC;AAAvB,8FAAA,KAAK,OAAA;AACd,yCAAwC;AAA/B,sGAAA,SAAS,OAAA;AAClB,mDAAiC;AACjC,mDAAkD;AAAzC,gHAAA,cAAc,OAAA;AACvB,mCAAyG;AAAhG,gGAAA,MAAM,OAAA;AAAE,4GAAA,kBAAkB,OAAA;AAAE,2GAAA,iBAAiB,OAAA;AAAE,wHAAA,8BAA8B,OAAA;AACtF,yCAAwC;AAA/B,sGAAA,SAAS,OAAA;AAClB,mCAAkC;AAAzB,gGAAA,MAAM,OAAA;AACf,uCAAsC;AAA7B,oGAAA,QAAQ,OAAA;AAEjB,OAAO;AACP,uCAAsC;AAA7B,oGAAA,QAAQ,OAAA;AAEjB,SAAS;AACT,2CAAyB;AAEzB,WAAW;AACX,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,qCAAoC;AAA3B,kGAAA,OAAO,OAAA;AAEhB,MAAM;AACN,6BAAuC;AAA9B,2GAAA,OAAO,OAAO;AACvB,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAE5B,OAAO;AACP,+BAAyC;AAAhC,6GAAA,OAAO,OAAQ;AAExB,QAAQ;AACR,iCAA2C;AAAlC,+GAAA,OAAO,OAAS;AACzB,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAC9B,qCAAoC;AAA3B,kGAAA,OAAO,OAAA;AAEhB,sBAAsB;AACtB,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAE5B,cAAc;AACd,gDAA8B;AAE9B,eAAe;AACf,mCAAkC;AAAzB,gGAAA,MAAM,OAAA;AACf,uCAAsC;AAA7B,oGAAA,QAAQ,OAAA;AACjB,iDAAgD;AAAvC,8GAAA,aAAa,OAAA;AAEtB,SAAS;AACT,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAC9B,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAE9B,gBAAgB;AAChB,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAE9B,2CAAyB;AACzB,0CAAwB;AACxB,8CAA4B;AAC5B,yCAAuB;AACvB,2CAAyB;AACzB,sDAAoC;AACpC,wDAAsC;AACtC,sDAAoC;AACpC,0DAAwC;AACxC,wCAAsB;AACtB,yCAAuB;AAEvB,gDAA8B;AAC9B,yCAAuB;AACvB,8CAA4B","file":"index.js","sourcesContent":["// type check\nexport { default as isBoolean } from './isBoolean';\nexport { default as isFunction } from './isFunction';\nexport { default as isNil } from './isNil';\nexport { default as isNull } from './isNull';\nexport { default as isValid } from './isValid';\nexport { default as isObject } from './isObject';\nexport { default as isObjectLike } from './isObjectLike';\nexport { default as isPlainObject } from './isPlainObject';\nexport { default as isType } from './isType';\nexport { default as isUndefined } from './isUndefined';\nexport { default as isString } from './isString';\nexport { default as isArray } from './isArray';\nexport { default as isArrayLike } from './isArrayLike';\nexport { default as isDate } from './isDate';\nexport { default as isNumber } from './isNumber';\nexport { default as isNumeric } from './isNumeric';\nexport { default as isValidNumber } from './isValidNumber';\nexport { default as isValidUrl } from './isValidUrl';\nexport { default as isRegExp } from './isRegExp';\nexport { default as isBase64 } from './isBase64';\n\nexport { default as isEmpty } from './isEmpty';\n\n// object\nexport { default as get } from './get';\nexport { default as has } from './has';\nexport { default as clone } from './clone';\nexport { default as cloneDeep } from './cloneDeep';\nexport { default as merge, baseMerge } from './merge';\nexport { default as pick } from './pick';\nexport { default as pickWithout } from './pickWithout';\nexport { isEqual } from './isEqual';\nexport { isShallowEqual } from './isShallowEqual';\nexport * from './mixin';\n\n// array\nexport * from './array';\nexport { range } from './range';\nexport { ascending } from './ascending';\nexport * from './quantileSorted';\nexport { normalQuantile } from './normalQuantile';\nexport { bisect, findZeroOfFunction, binaryFuzzySearch, binaryFuzzySearchInNumberRange } from './bisect';\nexport { deviation } from './deviation';\nexport { median } from './median';\nexport { variance } from './variance';\n\n// tick\nexport { tickStep } from './tickStep';\n\n// number\nexport * from './number';\n\n// function\nexport { default as constant } from './constant';\nexport { memoize } from './memoize';\n\n// pad\nexport { default as pad } from './pad';\nexport { default as truncate } from './truncate';\n\n// uuid\nexport { default as uuid } from './uuid';\n\n// clamp\nexport { default as clamp } from './clamp';\nexport { default as clampRange } from './clampRange';\nexport { clamper } from './clamper';\n\n// debounce & throttle\nexport { default as debounce } from './debounce';\nexport { default as throttle } from './throttle';\n\n// interpolate\nexport * from './interpolate';\n\n// type convert\nexport { toDate } from './toDate';\nexport { toNumber } from './toNumber';\nexport { toValidNumber } from './toValidNumber';\n\n// string\nexport { default as lowerFirst } from './lowerFirst';\nexport { default as upperFirst } from './upperFirst';\n\n// string format\nexport { default as substitute } from './substitute';\n\nexport * from './random';\nexport * from './field';\nexport * from './toPercent';\nexport * from './zero';\nexport * from './extent';\nexport * from './regression-linear';\nexport * from './regression-logistic';\nexport * from './regression-lowess';\nexport * from './regression-polynomial';\nexport * from './kde';\nexport * from './ecdf';\n\nexport * from './correlation';\nexport * from './mean';\nexport * from './bootstrap';\n"]}
+{"version":3,"sources":["../src/common/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA,aAAa;AACb,yCAAmD;AAA1C,uHAAA,OAAO,OAAa;AAC7B,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAC9B,iCAA2C;AAAlC,+GAAA,OAAO,OAAS;AACzB,mCAA6C;AAApC,iHAAA,OAAO,OAAU;AAC1B,qCAA+C;AAAtC,mHAAA,OAAO,OAAW;AAC3B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,+CAAyD;AAAhD,6HAAA,OAAO,OAAgB;AAChC,iDAA2D;AAAlD,+HAAA,OAAO,OAAiB;AACjC,mCAA6C;AAApC,iHAAA,OAAO,OAAU;AAC1B,6CAAuD;AAA9C,2HAAA,OAAO,OAAe;AAC/B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,qCAA+C;AAAtC,mHAAA,OAAO,OAAW;AAC3B,6CAAuD;AAA9C,2HAAA,OAAO,OAAe;AAC/B,mCAA6C;AAApC,iHAAA,OAAO,OAAU;AAC1B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,yCAAmD;AAA1C,uHAAA,OAAO,OAAa;AAC7B,iDAA2D;AAAlD,+HAAA,OAAO,OAAiB;AACjC,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAC9B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAE5B,qCAA+C;AAAtC,mHAAA,OAAO,OAAW;AAE3B,SAAS;AACT,6BAAuC;AAA9B,2GAAA,OAAO,OAAO;AACvB,6BAAuC;AAA9B,2GAAA,OAAO,OAAO;AACvB,iCAA2C;AAAlC,+GAAA,OAAO,OAAS;AACzB,yCAAmD;AAA1C,uHAAA,OAAO,OAAa;AAC7B,iCAAsD;AAA7C,+GAAA,OAAO,OAAS;AAAE,kGAAA,SAAS,OAAA;AACpC,+BAAyC;AAAhC,6GAAA,OAAO,OAAQ;AACxB,6CAAuD;AAA9C,2HAAA,OAAO,OAAe;AAC/B,qCAAoC;AAA3B,kGAAA,OAAO,OAAA;AAChB,mDAAkD;AAAzC,gHAAA,cAAc,OAAA;AACvB,0CAAwB;AAExB,QAAQ;AACR,0CAAwB;AACxB,iCAAgC;AAAvB,8FAAA,KAAK,OAAA;AACd,yCAAwC;AAA/B,sGAAA,SAAS,OAAA;AAClB,mDAAiC;AACjC,mDAAkD;AAAzC,gHAAA,cAAc,OAAA;AACvB,mCAAyG;AAAhG,gGAAA,MAAM,OAAA;AAAE,4GAAA,kBAAkB,OAAA;AAAE,2GAAA,iBAAiB,OAAA;AAAE,wHAAA,8BAA8B,OAAA;AACtF,yCAAwC;AAA/B,sGAAA,SAAS,OAAA;AAClB,mCAAkC;AAAzB,gGAAA,MAAM,OAAA;AACf,uCAAsC;AAA7B,oGAAA,QAAQ,OAAA;AAEjB,OAAO;AACP,uCAAsC;AAA7B,oGAAA,QAAQ,OAAA;AAEjB,SAAS;AACT,2CAAyB;AAEzB,WAAW;AACX,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,qCAAoC;AAA3B,kGAAA,OAAO,OAAA;AAEhB,MAAM;AACN,6BAAuC;AAA9B,2GAAA,OAAO,OAAO;AACvB,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAE5B,OAAO;AACP,+BAAyC;AAAhC,6GAAA,OAAO,OAAQ;AAExB,QAAQ;AACR,iCAA2C;AAAlC,+GAAA,OAAO,OAAS;AACzB,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAC9B,qCAAoC;AAA3B,kGAAA,OAAO,OAAA;AAEhB,sBAAsB;AACtB,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAC5B,uCAAiD;AAAxC,qHAAA,OAAO,OAAY;AAE5B,cAAc;AACd,gDAA8B;AAE9B,eAAe;AACf,mCAAkC;AAAzB,gGAAA,MAAM,OAAA;AACf,uCAAsC;AAA7B,oGAAA,QAAQ,OAAA;AACjB,iDAAgD;AAAvC,8GAAA,aAAa,OAAA;AAEtB,SAAS;AACT,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAC9B,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAE9B,gBAAgB;AAChB,2CAAqD;AAA5C,yHAAA,OAAO,OAAc;AAE9B,2CAAyB;AACzB,0CAAwB;AACxB,8CAA4B;AAC5B,yCAAuB;AACvB,2CAAyB;AACzB,sDAAoC;AACpC,wDAAsC;AACtC,sDAAoC;AACpC,0DAAwC;AACxC,wCAAsB;AACtB,yCAAuB;AAEvB,gDAA8B;AAC9B,yCAAuB;AACvB,8CAA4B;AAC5B,yDAAuC","file":"index.js","sourcesContent":["// type check\nexport { default as isBoolean } from './isBoolean';\nexport { default as isFunction } from './isFunction';\nexport { default as isNil } from './isNil';\nexport { default as isNull } from './isNull';\nexport { default as isValid } from './isValid';\nexport { default as isObject } from './isObject';\nexport { default as isObjectLike } from './isObjectLike';\nexport { default as isPlainObject } from './isPlainObject';\nexport { default as isType } from './isType';\nexport { default as isUndefined } from './isUndefined';\nexport { default as isString } from './isString';\nexport { default as isArray } from './isArray';\nexport { default as isArrayLike } from './isArrayLike';\nexport { default as isDate } from './isDate';\nexport { default as isNumber } from './isNumber';\nexport { default as isNumeric } from './isNumeric';\nexport { default as isValidNumber } from './isValidNumber';\nexport { default as isValidUrl } from './isValidUrl';\nexport { default as isRegExp } from './isRegExp';\nexport { default as isBase64 } from './isBase64';\n\nexport { default as isEmpty } from './isEmpty';\n\n// object\nexport { default as get } from './get';\nexport { default as has } from './has';\nexport { default as clone } from './clone';\nexport { default as cloneDeep } from './cloneDeep';\nexport { default as merge, baseMerge } from './merge';\nexport { default as pick } from './pick';\nexport { default as pickWithout } from './pickWithout';\nexport { isEqual } from './isEqual';\nexport { isShallowEqual } from './isShallowEqual';\nexport * from './mixin';\n\n// array\nexport * from './array';\nexport { range } from './range';\nexport { ascending } from './ascending';\nexport * from './quantileSorted';\nexport { normalQuantile } from './normalQuantile';\nexport { bisect, findZeroOfFunction, binaryFuzzySearch, binaryFuzzySearchInNumberRange } from './bisect';\nexport { deviation } from './deviation';\nexport { median } from './median';\nexport { variance } from './variance';\n\n// tick\nexport { tickStep } from './tickStep';\n\n// number\nexport * from './number';\n\n// function\nexport { default as constant } from './constant';\nexport { memoize } from './memoize';\n\n// pad\nexport { default as pad } from './pad';\nexport { default as truncate } from './truncate';\n\n// uuid\nexport { default as uuid } from './uuid';\n\n// clamp\nexport { default as clamp } from './clamp';\nexport { default as clampRange } from './clampRange';\nexport { clamper } from './clamper';\n\n// debounce & throttle\nexport { default as debounce } from './debounce';\nexport { default as throttle } from './throttle';\n\n// interpolate\nexport * from './interpolate';\n\n// type convert\nexport { toDate } from './toDate';\nexport { toNumber } from './toNumber';\nexport { toValidNumber } from './toValidNumber';\n\n// string\nexport { default as lowerFirst } from './lowerFirst';\nexport { default as upperFirst } from './upperFirst';\n\n// string format\nexport { default as substitute } from './substitute';\n\nexport * from './random';\nexport * from './field';\nexport * from './toPercent';\nexport * from './zero';\nexport * from './extent';\nexport * from './regression-linear';\nexport * from './regression-logistic';\nexport * from './regression-lowess';\nexport * from './regression-polynomial';\nexport * from './kde';\nexport * from './ecdf';\n\nexport * from './correlation';\nexport * from './mean';\nexport * from './bootstrap';\nexport * from './regression-bootstrap';\n"]}

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-bootstrap.d.ts

@@ -0,0 +1,14 @@
+import { type RegressionPoint } from './regression-solver';
+/** 成对 percentile bootstrap；每次重采样仅拟合一次，固定原始坐标基底。 */
+export declare function regressionBootstrap(data: readonly RegressionPoint[], options: {
+    method: 'linear' | 'polynomial';
+    degree?: number;
+    grid: readonly number[];
+    level: number;
+    resamples: number;
+    seed: number;
+}): {
+    x: number;
+    lower: number;
+    upper: number;
+}[];

package/cjs/common/regression-bootstrap.js

@@ -0,0 +1,37 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+}), exports.regressionBootstrap = void 0;
+
+const random_1 = require("./random"), quantileSorted_1 = require("./quantileSorted"), regression_solver_1 = require("./regression-solver");
+
+/** 成对 percentile bootstrap；每次重采样仅拟合一次，固定原始坐标基底。 */
+function regressionBootstrap(data, options) {
+    var _a;
+    const degree = "linear" === options.method ? 1 : null !== (_a = options.degree) && void 0 !== _a ? _a : NaN;
+    if ("linear" !== options.method && "polynomial" !== options.method || !Number.isInteger(degree) || degree < 1 || !data.length || data.some((p => !Number.isFinite(p.x) || !Number.isFinite(p.y))) || options.grid.some((x => !Number.isFinite(x))) || !(options.level > 0 && options.level < 1) || !Number.isInteger(options.resamples) || options.resamples < 1 || !Number.isInteger(options.seed) || options.seed < 0 || options.seed > 4294967295) throw new RangeError("Invalid paired regression bootstrap inputs");
+    if (data.length <= degree + 1) throw new RangeError("Regression bootstrap requires positive residual degrees of freedom");
+    const sorted = data.slice().sort(((a, b) => a.x - b.x || a.y - b.y)), basis = (0, 
+    regression_solver_1.regressionBasis)(sorted);
+    if ((0, regression_solver_1.fitRegression)(sorted, degree, basis).rank < degree + 1) throw new RangeError("Original regression design is rank deficient");
+    const random = (0, random_1.randomLCG)(options.seed), sample = new Array(sorted.length), values = options.grid.map((() => new Array(options.resamples)));
+    for (let b = 0; b < options.resamples; b++) {
+        for (let i = 0; i < sample.length; i++) sample[i] = sorted[Math.floor(random() * sorted.length)];
+        const model = (0, regression_solver_1.fitRegression)(sample, degree, basis);
+        for (let j = 0; j < options.grid.length; j++) {
+            const value = (0, regression_solver_1.regressionPrediction)(model, options.grid[j]);
+            if (!Number.isFinite(value)) throw new RangeError("Regression bootstrap prediction is not finite");
+            values[j][b] = value;
+        }
+    }
+    const tail = (1 - options.level) / 2;
+    return options.grid.map(((x, j) => (values[j].sort(((a, b) => a - b)), {
+        x: x,
+        lower: (0, quantileSorted_1.quantileSorted)(values[j], tail),
+        upper: (0, quantileSorted_1.quantileSorted)(values[j], 1 - tail)
+    })));
+}
+
+exports.regressionBootstrap = regressionBootstrap;
+//# sourceMappingURL=regression-bootstrap.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/regression-bootstrap.ts"],"names":[],"mappings":";;;AAAA,qCAAqC;AACrC,qDAAkD;AAClD,2DAAiH;AAEjH,mDAAmD;AACnD,SAAgB,mBAAmB,CACjC,IAAgC,EAChC,OAOC;;IAED,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAA,OAAO,CAAC,MAAM,mCAAI,GAAG,CAAC;IACvE,IACE,CAAC,OAAO,CAAC,MAAM,KAAK,QAAQ,IAAI,OAAO,CAAC,MAAM,KAAK,YAAY,CAAC;QAChE,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC;QACzB,MAAM,GAAG,CAAC;QACV,CAAC,IAAI,CAAC,MAAM;QACZ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,IAAI,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;QACzC,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC;QACpC,OAAO,CAAC,SAAS,GAAG,CAAC;QACrB,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC;QAC/B,OAAO,CAAC,IAAI,GAAG,CAAC;QAChB,OAAO,CAAC,IAAI,GAAG,UAAU,EACzB;QACA,MAAM,IAAI,UAAU,CAAC,4CAA4C,CAAC,CAAC;KACpE;IACD,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM,GAAG,CAAC,EAAE;QAC7B,MAAM,IAAI,UAAU,CAAC,oEAAoE,CAAC,CAAC;KAC5F;IACD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,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;IACnE,MAAM,KAAK,GAAG,IAAA,mCAAe,EAAC,MAAM,CAAC,CAAC;IACtC,IAAI,IAAA,iCAAa,EAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,IAAI,GAAG,MAAM,GAAG,CAAC,EAAE;QAC1D,MAAM,IAAI,UAAU,CAAC,8CAA8C,CAAC,CAAC;KACtE;IACD,MAAM,MAAM,GAAG,IAAA,kBAAS,EAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAkB,MAAM,CAAC,MAAM,CAAC,CAAC;IACzD,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;SAC1D;QACD,MAAM,KAAK,GAAG,IAAA,iCAAa,EAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAA,wCAAoB,EAAC,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;gBAC3B,MAAM,IAAI,UAAU,CAAC,+CAA+C,CAAC,CAAC;aACvE;YACD,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;SACtB;KACF;IACD,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACrC,OAAO,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC/B,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,IAAA,+BAAc,EAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,IAAA,+BAAc,EAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IACnG,CAAC,CAAC,CAAC;AACL,CAAC;AAzDD,kDAyDC","file":"regression-bootstrap.js","sourcesContent":["import { randomLCG } from './random';\nimport { quantileSorted } from './quantileSorted';\nimport { fitRegression, regressionBasis, regressionPrediction, type RegressionPoint } from './regression-solver';\n\n/** 成对 percentile bootstrap；每次重采样仅拟合一次，固定原始坐标基底。 */\nexport function regressionBootstrap(\n  data: readonly RegressionPoint[],\n  options: {\n    method: 'linear' | 'polynomial';\n    degree?: number;\n    grid: readonly number[];\n    level: number;\n    resamples: number;\n    seed: number;\n  }\n) {\n  const degree = options.method === 'linear' ? 1 : options.degree ?? NaN;\n  if (\n    (options.method !== 'linear' && options.method !== 'polynomial') ||\n    !Number.isInteger(degree) ||\n    degree < 1 ||\n    !data.length ||\n    data.some(p => !Number.isFinite(p.x) || !Number.isFinite(p.y)) ||\n    options.grid.some(x => !Number.isFinite(x)) ||\n    !(options.level > 0 && options.level < 1) ||\n    !Number.isInteger(options.resamples) ||\n    options.resamples < 1 ||\n    !Number.isInteger(options.seed) ||\n    options.seed < 0 ||\n    options.seed > 0xffffffff\n  ) {\n    throw new RangeError('Invalid paired regression bootstrap inputs');\n  }\n  if (data.length <= degree + 1) {\n    throw new RangeError('Regression bootstrap requires positive residual degrees of freedom');\n  }\n  const sorted = data.slice().sort((a, b) => a.x - b.x || a.y - b.y);\n  const basis = regressionBasis(sorted);\n  if (fitRegression(sorted, degree, basis).rank < degree + 1) {\n    throw new RangeError('Original regression design is rank deficient');\n  }\n  const random = randomLCG(options.seed);\n  const sample = new Array<RegressionPoint>(sorted.length);\n  const values = options.grid.map(() => new Array<number>(options.resamples));\n  for (let b = 0; b < options.resamples; b++) {\n    for (let i = 0; i < sample.length; i++) {\n      sample[i] = sorted[Math.floor(random() * sorted.length)];\n    }\n    const model = fitRegression(sample, degree, basis);\n    for (let j = 0; j < options.grid.length; j++) {\n      const value = regressionPrediction(model, options.grid[j]);\n      if (!Number.isFinite(value)) {\n        throw new RangeError('Regression bootstrap prediction is not finite');\n      }\n      values[j][b] = value;\n    }\n  }\n  const tail = (1 - options.level) / 2;\n  return options.grid.map((x, j) => {\n    values[j].sort((a, b) => a - b);\n    return { x, lower: quantileSorted(values[j], tail), upper: quantileSorted(values[j], 1 - tail) };\n  });\n}\n"]}

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

@@ -15,6 +15,7 @@ export declare function regressionLinear(data: any[], x?: (d: any) => number, y?
         a: number;
         b: number;
     };
+    rank: number;
     predict: (xx: number) => number;
     rSquared: number;
     evaluateGrid: (N: number) => {

package/cjs/common/regression-linear.js

@@ -10,7 +10,7 @@ Object.defineProperty(exports, "__esModule", {
     value: !0
 }), exports.regressionLinear = exports.rSquared = exports.visitPoints = exports.ordinaryLeastSquares = void 0;
 
-const isNil_1 = __importDefault(require("./isNil")), regression_utils_1 = require("./regression-utils");
+const isNil_1 = __importDefault(require("./isNil")), regression_solver_1 = require("./regression-solver"), regression_utils_1 = require("./regression-utils");
 
 /**
  * Linear regression utilities (single clean implementation).
@@ -54,41 +54,23 @@ function rSquared(data, x, y, uY, predict) {
 
 function regressionLinear(data, x = (d => d.x), y = (d => d.y), options) {
     var _a;
-    const alpha = null !== (_a = null == options ? void 0 : options.alpha) && void 0 !== _a ? _a : .05;
-    // accumulate online means (sufficient statistics)
-        let n = 0, meanX = 0, meanY = 0, meanXY = 0, meanX2 = 0;
-    visitPoints(data, x, y, ((xi, yi) => {
-        n++, meanX += (xi - meanX) / n, meanY += (yi - meanY) / n, meanXY += (xi * yi - meanXY) / n, 
-        meanX2 += (xi * xi - meanX2) / n;
-    }));
-    const {a: a, b: b} = ordinaryLeastSquares(meanX, meanY, meanXY, meanX2), predict = xx => a + b * xx, comps = (0, 
-    regression_utils_1.computeLinearCIComponents)(data, x, y, predict);
-    return {
+    const alpha = null !== (_a = null == options ? void 0 : options.alpha) && void 0 !== _a ? _a : .05, points = (0, 
+    regression_solver_1.regressionPoints)(data, x, y), model = (0, regression_solver_1.fitRegression)(points, 1), coef = (0, 
+    regression_solver_1.regressionCoefficients)(model), a = coef[0], b = coef[1], predict = xx => (0, 
+    regression_solver_1.regressionPrediction)(model, xx), comps = (0, regression_utils_1.computeLinearCIComponents)(data, x, y, predict);
+    let meanY = 0;
+    return points.forEach(((p, i) => {
+        meanY += (p.y - meanY) / (i + 1);
+    })), {
         coef: {
             a: a,
             b: b
         },
+        rank: model.rank,
         predict: predict,
         rSquared: rSquared(data, x, y, meanY, predict),
         evaluateGrid: function(N) {
-            const out = [];
-            if (0 === comps.n || N <= 0) return out;
-            if (comps.min === comps.max) {
-                for (let i = 0; i < N; i++) out.push({
-                    x: comps.min,
-                    y: predict(comps.min)
-                });
-                return out;
-            }
-            const step = (comps.max - comps.min) / (N - 1);
-            for (let i = 0; i < N; i++) {
-                const px = i === N - 1 ? comps.max : comps.min + step * i;
-                out.push({
-                    x: px,
-                    y: predict(px)
-                });
-            }
-            return out;
+            return (0, regression_solver_1.regressionGrid)(comps.min, comps.max, N, predict);
         },
         confidenceInterval: function(N = 50) {
             const out = [];

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

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/regression-linear.ts"],"names":[],"mappings":";;;;;;AAAA,oDAA4B;AAC5B,yDAK4B;AAE5B;;;GAGG;AAEH,SAAgB,oBAAoB,CAAC,EAAU,EAAE,EAAU,EAAE,GAAW,EAAE,GAAW;IACnF,MAAM,KAAK,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;IAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE;QACpC,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;KACxB;IACD,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;IAClC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACtB,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AAClB,CAAC;AARD,oDAQC;AAED,SAAgB,WAAW,CACzB,IAAW,EACX,CAAqB,EACrB,CAAqB,EACrB,QAAuD;IAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,CAAC,IAAA,eAAK,EAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,IAAA,eAAK,EAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE;YACpE,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SACrB;KACF;AACH,CAAC;AAdD,kCAcC;AAED,SAAgB,QAAQ,CACtB,IAAW,EACX,CAAqB,EACrB,CAAqB,EACrB,EAAU,EACV,OAA8B;IAE9B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,CAAC,IAAA,eAAK,EAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE;YAClC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACjB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACb,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;YAClB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;SACd;KACF;IACD,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;AACvC,CAAC;AArBD,4BAqBC;AAED,SAAgB,gBAAgB,CAC9B,IAAW,EACX,IAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAChC,IAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAChC,OAEC;;IAED,MAAM,KAAK,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,mCAAI,IAAI,CAAC;IACrC,kDAAkD;IAClD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;QACjC,CAAC,EAAE,CAAC;QACJ,KAAK,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QACjC,MAAM,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,oBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACpE,MAAM,OAAO,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IAE3C,MAAM,KAAK,GAAG,IAAA,4CAAyB,EAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAE7D,SAAS,YAAY,CAAC,CAAS;QAC7B,MAAM,GAAG,GAA+B,EAAE,CAAC;QAC3C,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAC3B,OAAO,GAAG,CAAC;SACZ;QACD,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aACnD;YACD,OAAO,GAAG,CAAC;SACZ;QACD,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,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,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;YAC1D,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACrC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,SAAS,kBAAkB,CAAC,IAAY,EAAE;QACxC,MAAM,GAAG,GAAsG,EAAE,CAAC;QAClH,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAC3B,OAAO,GAAG,CAAC;SACZ;QACD,MAAM,CAAC,GAAG,IAAA,0CAAuB,EAAC,KAAK,CAAC,CAAC;QACzC,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE;YAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC7B,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;QACD,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,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,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;YAC1D,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACtB,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,CAAC;gBACP,KAAK,EAAE,CAAC,GAAG,aAAa;gBACxB,KAAK,EAAE,CAAC,GAAG,aAAa;gBACxB,SAAS,EAAE,CAAC,GAAG,aAAa;gBAC5B,SAAS,EAAE,CAAC,GAAG,aAAa;aAC7B,CAAC,CAAC;SACJ;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO;QACL,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE;QACd,OAAO;QACP,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC;QAC9C,YAAY;QACZ,kBAAkB;KACnB,CAAC;AACJ,CAAC;AAjGD,4CAiGC;AAED,kBAAe;IACb,oBAAoB;IACpB,WAAW;IACX,QAAQ;IACR,gBAAgB;CACjB,CAAC","file":"regression-linear.js","sourcesContent":["import isNil from './isNil';\nimport {\n  computeLinearCIComponents,\n  confidenceCriticalValue,\n  confidenceHalfWidth,\n  stdErrorsAt\n} from './regression-utils';\n\n/**\n * Linear regression utilities (single clean implementation).\n * Exports: ordinaryLeastSquares, visitPoints, rSquared, regressionLinear\n */\n\nexport function ordinaryLeastSquares(uX: number, uY: number, uXY: number, uX2: number) {\n  const denom = uX2 - uX * uX;\n  if (Math.abs(denom) < Number.EPSILON) {\n    return { a: uY, b: 0 };\n  }\n  const b = (uXY - uX * uY) / denom;\n  const a = uY - b * uX;\n  return { a, b };\n}\n\nexport function visitPoints(\n  data: any[],\n  x: (d: any) => number,\n  y: (d: any) => number,\n  callback: (x: number, y: number, index: number) => void\n) {\n  for (let i = 0; i < data.length; i++) {\n    const d = data[i];\n    let xi = x(d);\n    let yi = y(d);\n    if (!isNil(xi) && (xi = +xi) >= xi && !isNil(yi) && (yi = +yi) >= yi) {\n      callback(xi, yi, i);\n    }\n  }\n}\n\nexport function rSquared(\n  data: any[],\n  x: (d: any) => number,\n  y: (d: any) => number,\n  uY: number,\n  predict: (x: number) => number\n) {\n  let ssr = 0;\n  let sst = 0;\n  for (let i = 0; i < data.length; i++) {\n    const d = data[i];\n    let yi = y(d);\n    if (!isNil(yi) && (yi = +yi) >= yi) {\n      const p = predict(x(d));\n      const r = yi - p;\n      ssr += r * r;\n      const t = yi - uY;\n      sst += t * t;\n    }\n  }\n  return sst === 0 ? 0 : 1 - ssr / sst;\n}\n\nexport function regressionLinear(\n  data: any[],\n  x: (d: any) => number = d => d.x,\n  y: (d: any) => number = d => d.y,\n  options?: {\n    alpha?: number;\n  }\n) {\n  const alpha = options?.alpha ?? 0.05;\n  // accumulate online means (sufficient statistics)\n  let n = 0;\n  let meanX = 0;\n  let meanY = 0;\n  let meanXY = 0;\n  let meanX2 = 0;\n\n  visitPoints(data, x, y, (xi, yi) => {\n    n++;\n    meanX += (xi - meanX) / n;\n    meanY += (yi - meanY) / n;\n    meanXY += (xi * yi - meanXY) / n;\n    meanX2 += (xi * xi - meanX2) / n;\n  });\n\n  const { a, b } = ordinaryLeastSquares(meanX, meanY, meanXY, meanX2);\n  const predict = (xx: number) => a + b * xx;\n\n  const comps = computeLinearCIComponents(data, x, y, predict);\n\n  function evaluateGrid(N: number) {\n    const out: { x: number; y: number }[] = [];\n    if (comps.n === 0 || N <= 0) {\n      return out;\n    }\n    if (comps.min === comps.max) {\n      for (let i = 0; i < N; i++) {\n        out.push({ x: comps.min, y: predict(comps.min) });\n      }\n      return out;\n    }\n    const step = (comps.max - comps.min) / (N - 1);\n    for (let i = 0; i < N; i++) {\n      const px = i === N - 1 ? comps.max : comps.min + step * i;\n      out.push({ x: px, y: predict(px) });\n    }\n    return out;\n  }\n\n  function confidenceInterval(N: number = 50) {\n    const out: { x: number; mean: number; lower: number; upper: number; predLower: number; predUpper: number }[] = [];\n    if (comps.n === 0 || N <= 0) {\n      return out;\n    }\n    const z = confidenceCriticalValue(alpha);\n    if (comps.min === comps.max) {\n      const m = predict(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: m,\n          lower: m - meanHalfWidth,\n          upper: m + meanHalfWidth,\n          predLower: m - predHalfWidth,\n          predUpper: m + predHalfWidth\n        });\n      }\n      return out;\n    }\n    const step = (comps.max - comps.min) / (N - 1);\n    for (let i = 0; i < N; i++) {\n      const px = i === N - 1 ? comps.max : comps.min + step * i;\n      const m = predict(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: m,\n        lower: m - meanHalfWidth,\n        upper: m + meanHalfWidth,\n        predLower: m - predHalfWidth,\n        predUpper: m + predHalfWidth\n      });\n    }\n    return out;\n  }\n\n  return {\n    coef: { a, b },\n    predict,\n    rSquared: rSquared(data, x, y, meanY, predict),\n    evaluateGrid,\n    confidenceInterval\n  };\n}\n\nexport default {\n  ordinaryLeastSquares,\n  visitPoints,\n  rSquared,\n  regressionLinear\n};\n"]}
+{"version":3,"sources":["../src/common/regression-linear.ts"],"names":[],"mappings":";;;;;;AAAA,oDAA4B;AAC5B,2DAM6B;AAC7B,yDAK4B;AAE5B;;;GAGG;AAEH,SAAgB,oBAAoB,CAAC,EAAU,EAAE,EAAU,EAAE,GAAW,EAAE,GAAW;IACnF,MAAM,KAAK,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC;IAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE;QACpC,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;KACxB;IACD,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC;IAClC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACtB,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AAClB,CAAC;AARD,oDAQC;AAED,SAAgB,WAAW,CACzB,IAAW,EACX,CAAqB,EACrB,CAAqB,EACrB,QAAuD;IAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,CAAC,IAAA,eAAK,EAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,IAAA,eAAK,EAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE;YACpE,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;SACrB;KACF;AACH,CAAC;AAdD,kCAcC;AAED,SAAgB,QAAQ,CACtB,IAAW,EACX,CAAqB,EACrB,CAAqB,EACrB,EAAU,EACV,OAA8B;IAE9B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,CAAC,IAAA,eAAK,EAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE;YAClC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACjB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACb,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;YAClB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;SACd;KACF;IACD,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;AACvC,CAAC;AArBD,4BAqBC;AAED,SAAgB,gBAAgB,CAC9B,IAAW,EACX,IAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAChC,IAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAChC,OAEC;;IAED,MAAM,KAAK,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,KAAK,mCAAI,IAAI,CAAC;IACrC,MAAM,MAAM,GAAG,IAAA,oCAAgB,EAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,IAAA,iCAAa,EAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,IAAA,0CAAsB,EAAC,KAAK,CAAC,CAAC;IAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,MAAM,OAAO,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,IAAA,wCAAoB,EAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAChE,MAAM,KAAK,GAAG,IAAA,4CAAyB,EAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAC7D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,SAAS,YAAY,CAAC,CAAS;QAC7B,OAAO,IAAA,kCAAc,EAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAC1D,CAAC;IAED,SAAS,kBAAkB,CAAC,IAAY,EAAE;QACxC,MAAM,GAAG,GAAsG,EAAE,CAAC;QAClH,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAC3B,OAAO,GAAG,CAAC;SACZ;QACD,MAAM,CAAC,GAAG,IAAA,0CAAuB,EAAC,KAAK,CAAC,CAAC;QACzC,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE;YAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC7B,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;QACD,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,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,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;YAC1D,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACtB,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,CAAC;gBACP,KAAK,EAAE,CAAC,GAAG,aAAa;gBACxB,KAAK,EAAE,CAAC,GAAG,aAAa;gBACxB,SAAS,EAAE,CAAC,GAAG,aAAa;gBAC5B,SAAS,EAAE,CAAC,GAAG,aAAa;aAC7B,CAAC,CAAC;SACJ;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO;QACL,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE;QACd,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,OAAO;QACP,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC;QAC9C,YAAY;QACZ,kBAAkB;KACnB,CAAC;AACJ,CAAC;AA3ED,4CA2EC;AAED,kBAAe;IACb,oBAAoB;IACpB,WAAW;IACX,QAAQ;IACR,gBAAgB;CACjB,CAAC","file":"regression-linear.js","sourcesContent":["import isNil from './isNil';\nimport {\n  regressionPoints,\n  fitRegression,\n  regressionPrediction,\n  regressionCoefficients,\n  regressionGrid\n} from './regression-solver';\nimport {\n  computeLinearCIComponents,\n  confidenceCriticalValue,\n  confidenceHalfWidth,\n  stdErrorsAt\n} from './regression-utils';\n\n/**\n * Linear regression utilities (single clean implementation).\n * Exports: ordinaryLeastSquares, visitPoints, rSquared, regressionLinear\n */\n\nexport function ordinaryLeastSquares(uX: number, uY: number, uXY: number, uX2: number) {\n  const denom = uX2 - uX * uX;\n  if (Math.abs(denom) < Number.EPSILON) {\n    return { a: uY, b: 0 };\n  }\n  const b = (uXY - uX * uY) / denom;\n  const a = uY - b * uX;\n  return { a, b };\n}\n\nexport function visitPoints(\n  data: any[],\n  x: (d: any) => number,\n  y: (d: any) => number,\n  callback: (x: number, y: number, index: number) => void\n) {\n  for (let i = 0; i < data.length; i++) {\n    const d = data[i];\n    let xi = x(d);\n    let yi = y(d);\n    if (!isNil(xi) && (xi = +xi) >= xi && !isNil(yi) && (yi = +yi) >= yi) {\n      callback(xi, yi, i);\n    }\n  }\n}\n\nexport function rSquared(\n  data: any[],\n  x: (d: any) => number,\n  y: (d: any) => number,\n  uY: number,\n  predict: (x: number) => number\n) {\n  let ssr = 0;\n  let sst = 0;\n  for (let i = 0; i < data.length; i++) {\n    const d = data[i];\n    let yi = y(d);\n    if (!isNil(yi) && (yi = +yi) >= yi) {\n      const p = predict(x(d));\n      const r = yi - p;\n      ssr += r * r;\n      const t = yi - uY;\n      sst += t * t;\n    }\n  }\n  return sst === 0 ? 0 : 1 - ssr / sst;\n}\n\nexport function regressionLinear(\n  data: any[],\n  x: (d: any) => number = d => d.x,\n  y: (d: any) => number = d => d.y,\n  options?: {\n    alpha?: number;\n  }\n) {\n  const alpha = options?.alpha ?? 0.05;\n  const points = regressionPoints(data, x, y);\n  const model = fitRegression(points, 1);\n  const coef = regressionCoefficients(model);\n  const a = coef[0];\n  const b = coef[1];\n  const predict = (xx: number) => regressionPrediction(model, xx);\n  const comps = computeLinearCIComponents(data, x, y, predict);\n  let meanY = 0;\n  points.forEach((p, i) => {\n    meanY += (p.y - meanY) / (i + 1);\n  });\n\n  function evaluateGrid(N: number) {\n    return regressionGrid(comps.min, comps.max, N, predict);\n  }\n\n  function confidenceInterval(N: number = 50) {\n    const out: { x: number; mean: number; lower: number; upper: number; predLower: number; predUpper: number }[] = [];\n    if (comps.n === 0 || N <= 0) {\n      return out;\n    }\n    const z = confidenceCriticalValue(alpha);\n    if (comps.min === comps.max) {\n      const m = predict(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: m,\n          lower: m - meanHalfWidth,\n          upper: m + meanHalfWidth,\n          predLower: m - predHalfWidth,\n          predUpper: m + predHalfWidth\n        });\n      }\n      return out;\n    }\n    const step = (comps.max - comps.min) / (N - 1);\n    for (let i = 0; i < N; i++) {\n      const px = i === N - 1 ? comps.max : comps.min + step * i;\n      const m = predict(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: m,\n        lower: m - meanHalfWidth,\n        upper: m + meanHalfWidth,\n        predLower: m - predHalfWidth,\n        predUpper: m + predHalfWidth\n      });\n    }\n    return out;\n  }\n\n  return {\n    coef: { a, b },\n    rank: model.rank,\n    predict,\n    rSquared: rSquared(data, x, y, meanY, predict),\n    evaluateGrid,\n    confidenceInterval\n  };\n}\n\nexport default {\n  ordinaryLeastSquares,\n  visitPoints,\n  rSquared,\n  regressionLinear\n};\n"]}

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

@@ -1,11 +1,7 @@
 /**
- * Simple lowess implementation (univariate x)
- * options:
- * - span: fraction of points used in local regression (0,1]
- * - degree: 0 (constant) or 1 (linear)
- * - iterations: number of robustifying iterations
- * - alpha: confidence level for CI
- * - maxSamples: maximum number of points to use (default: 1000 for fast processing)
+ * 局部线性 LOWESS。默认全量观测、span=2/3、三次稳健重加权。
+ * delta 显式插值加速；maxSamples 仅保留显式选择的历史抽样用途。
+ * predict 与 evaluateGrid 查询构建时固定的同一模型，不触发再拟合。
  */
 export declare function regressionLowess(data: any[], x?: (d: any) => number, y?: (d: any) => number, options?: {
     span?: number;
@@ -13,9 +9,10 @@ export declare function regressionLowess(data: any[], x?: (d: any) => number, y?
     iterations?: number;
     alpha?: number;
     maxSamples?: number;
+    delta?: number;
 }): {
     predict: (x0: number | number[]) => number | number[];
-    evaluate: any;
+    evaluate: (x0: number | number[]) => number | number[];
     evaluateGrid: (N: number) => {
         x: number;
         y: number;
@@ -28,5 +25,9 @@ export declare function regressionLowess(data: any[], x?: (d: any) => number, y?
         predLower: number;
         predUpper: number;
     }[];
+    fitted: {
+        x: number;
+        y: number;
+    }[];
 };
 export default regressionLowess;