@visactor/vutils 1.0.25 → 1.0.26

package/es/common/ascending.js

@@ -1,3 +1,4 @@
 export function ascending(a, b) {
     return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;
-}
+}
+//# sourceMappingURL=ascending.js.map

package/es/common/deviation.js

@@ -3,5 +3,4 @@ import { variance } from "./variance";
 export function deviation(values, valueof) {
     const v = variance(values, valueof);
     return v ? Math.sqrt(v) : v;
-}
-//# sourceMappingURL=deviation.js.map
+}

package/es/common/getType.js

@@ -1,3 +1,4 @@
 const getType = value => ({}.toString.call(value).replace(/^\[object /, "").replace(/]$/, ""));
 
-export default getType;
+export default getType;
+//# sourceMappingURL=getType.js.map

package/es/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/es/common/index.js

@@ -157,4 +157,6 @@ export * from "./correlation";
 export * from "./mean";
 
 export * from "./bootstrap";
+
+export * from "./regression-bootstrap";
 //# sourceMappingURL=index.js.map

package/es/common/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/index.ts"],"names":[],"mappings":"AAAA,aAAa;AACb,OAAO,EAAE,OAAO,IAAI,SAAS,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,OAAO,IAAI,KAAK,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,OAAO,IAAI,MAAM,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,OAAO,IAAI,OAAO,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,gBAAgB,CAAC;AACzD,OAAO,EAAE,OAAO,IAAI,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAC3D,OAAO,EAAE,OAAO,IAAI,MAAM,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,OAAO,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,EAAE,OAAO,IAAI,MAAM,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,SAAS,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,EAAE,OAAO,IAAI,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAC3D,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEjD,OAAO,EAAE,OAAO,IAAI,OAAO,EAAE,MAAM,WAAW,CAAC;AAE/C,SAAS;AACT,OAAO,EAAE,OAAO,IAAI,GAAG,EAAE,MAAM,OAAO,CAAC;AACvC,OAAO,EAAE,OAAO,IAAI,GAAG,EAAE,MAAM,OAAO,CAAC;AACvC,OAAO,EAAE,OAAO,IAAI,KAAK,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,OAAO,IAAI,SAAS,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,EAAE,OAAO,IAAI,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,OAAO,IAAI,IAAI,EAAE,MAAM,QAAQ,CAAC;AACzC,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,cAAc,SAAS,CAAC;AAExB,QAAQ;AACR,cAAc,SAAS,CAAC;AACxB,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,8BAA8B,EAAE,MAAM,UAAU,CAAC;AACzG,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC,OAAO;AACP,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC,SAAS;AACT,cAAc,UAAU,CAAC;AAEzB,WAAW;AACX,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,MAAM;AACN,OAAO,EAAE,OAAO,IAAI,GAAG,EAAE,MAAM,OAAO,CAAC;AACvC,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEjD,OAAO;AACP,OAAO,EAAE,OAAO,IAAI,IAAI,EAAE,MAAM,QAAQ,CAAC;AAEzC,QAAQ;AACR,OAAO,EAAE,OAAO,IAAI,KAAK,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,sBAAsB;AACtB,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEjD,cAAc;AACd,cAAc,eAAe,CAAC;AAE9B,eAAe;AACf,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,SAAS;AACT,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AAErD,gBAAgB;AAChB,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AAErD,cAAc,UAAU,CAAC;AACzB,cAAc,SAAS,CAAC;AACxB,cAAc,aAAa,CAAC;AAC5B,cAAc,QAAQ,CAAC;AACvB,cAAc,UAAU,CAAC;AACzB,cAAc,qBAAqB,CAAC;AACpC,cAAc,uBAAuB,CAAC;AACtC,cAAc,qBAAqB,CAAC;AACpC,cAAc,yBAAyB,CAAC;AACxC,cAAc,OAAO,CAAC;AACtB,cAAc,QAAQ,CAAC;AAEvB,cAAc,eAAe,CAAC;AAC9B,cAAc,QAAQ,CAAC;AACvB,cAAc,aAAa,CAAC","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,OAAO,EAAE,OAAO,IAAI,SAAS,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,OAAO,IAAI,KAAK,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,OAAO,IAAI,MAAM,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,OAAO,IAAI,OAAO,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,gBAAgB,CAAC;AACzD,OAAO,EAAE,OAAO,IAAI,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAC3D,OAAO,EAAE,OAAO,IAAI,MAAM,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,OAAO,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,EAAE,OAAO,IAAI,MAAM,EAAE,MAAM,UAAU,CAAC;AAC7C,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,SAAS,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,EAAE,OAAO,IAAI,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAC3D,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEjD,OAAO,EAAE,OAAO,IAAI,OAAO,EAAE,MAAM,WAAW,CAAC;AAE/C,SAAS;AACT,OAAO,EAAE,OAAO,IAAI,GAAG,EAAE,MAAM,OAAO,CAAC;AACvC,OAAO,EAAE,OAAO,IAAI,GAAG,EAAE,MAAM,OAAO,CAAC;AACvC,OAAO,EAAE,OAAO,IAAI,KAAK,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,OAAO,IAAI,SAAS,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,EAAE,OAAO,IAAI,KAAK,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,OAAO,IAAI,IAAI,EAAE,MAAM,QAAQ,CAAC;AACzC,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,eAAe,CAAC;AACvD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,cAAc,SAAS,CAAC;AAExB,QAAQ;AACR,cAAc,SAAS,CAAC;AACxB,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,cAAc,kBAAkB,CAAC;AACjC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,8BAA8B,EAAE,MAAM,UAAU,CAAC;AACzG,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC,OAAO;AACP,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC,SAAS;AACT,cAAc,UAAU,CAAC;AAEzB,WAAW;AACX,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,MAAM;AACN,OAAO,EAAE,OAAO,IAAI,GAAG,EAAE,MAAM,OAAO,CAAC;AACvC,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEjD,OAAO;AACP,OAAO,EAAE,OAAO,IAAI,IAAI,EAAE,MAAM,QAAQ,CAAC;AAEzC,QAAQ;AACR,OAAO,EAAE,OAAO,IAAI,KAAK,EAAE,MAAM,SAAS,CAAC;AAC3C,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,sBAAsB;AACtB,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEjD,cAAc;AACd,cAAc,eAAe,CAAC;AAE9B,eAAe;AACf,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,SAAS;AACT,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AAErD,gBAAgB;AAChB,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AAErD,cAAc,UAAU,CAAC;AACzB,cAAc,SAAS,CAAC;AACxB,cAAc,aAAa,CAAC;AAC5B,cAAc,QAAQ,CAAC;AACvB,cAAc,UAAU,CAAC;AACzB,cAAc,qBAAqB,CAAC;AACpC,cAAc,uBAAuB,CAAC;AACtC,cAAc,qBAAqB,CAAC;AACpC,cAAc,yBAAyB,CAAC;AACxC,cAAc,OAAO,CAAC;AACtB,cAAc,QAAQ,CAAC;AAEvB,cAAc,eAAe,CAAC;AAC9B,cAAc,QAAQ,CAAC;AACvB,cAAc,aAAa,CAAC;AAC5B,cAAc,wBAAwB,CAAC","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/es/common/isFunction.js

@@ -26,5 +26,4 @@
 // eslint-disable-next-line @typescript-eslint/ban-types
 const isFunction = value => "function" == typeof value;
 
-export default isFunction;
-//# sourceMappingURL=isFunction.js.map
+export default isFunction;

package/es/common/isObject.js

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

package/es/common/isPrototype.js

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

package/es/common/isRegExp.js

@@ -3,4 +3,4 @@ import isType from "./isType";
 const isRegExp = value => isType(value, "RegExp");
 
 export default isRegExp;
-//# sourceMappingURL=isRegExp.js.map
+//# sourceMappingURL=isRegExp.js.map

package/es/common/isShallowEqual.js

@@ -20,4 +20,4 @@ export function isShallowEqual(objA, objB) {
     return Object.keys(objA).forEach((k => !!is(objA[k], objB[k]) || (ret = !1, ret))), 
     ret;
 }
-//# sourceMappingURL=isShallowEqual.js.map
+//# sourceMappingURL=isShallowEqual.js.map

package/es/common/isString.js

@@ -18,4 +18,4 @@ import isType from "./isType";
 };
 
 export default isString;
-//# sourceMappingURL=isString.js.map
+//# sourceMappingURL=isString.js.map

package/es/common/isType.js

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

package/es/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/es/common/regression-bootstrap.js

@@ -0,0 +1,31 @@
+import { randomLCG } from "./random";
+
+import { quantileSorted } from "./quantileSorted";
+
+import { fitRegression, regressionBasis, regressionPrediction } from "./regression-solver";
+
+/** 成对 percentile bootstrap；每次重采样仅拟合一次，固定原始坐标基底。 */ export 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 = regressionBasis(sorted);
+    if (fitRegression(sorted, degree, basis).rank < degree + 1) throw new RangeError("Original regression design is rank deficient");
+    const random = 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 = fitRegression(sample, degree, basis);
+        for (let j = 0; j < options.grid.length; j++) {
+            const value = 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: quantileSorted(values[j], tail),
+        upper: quantileSorted(values[j], 1 - tail)
+    })));
+}
+//# sourceMappingURL=regression-bootstrap.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/regression-bootstrap.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AACrC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,oBAAoB,EAAwB,MAAM,qBAAqB,CAAC;AAEjH,mDAAmD;AACnD,MAAM,UAAU,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,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,IAAI,aAAa,CAAC,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,SAAS,CAAC,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,aAAa,CAAC,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,oBAAoB,CAAC,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,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IACnG,CAAC,CAAC,CAAC;AACL,CAAC","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/es/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/es/common/regression-linear.js

@@ -1,5 +1,7 @@
 import isNil from "./isNil";
 
+import { regressionPoints, fitRegression, regressionPrediction, regressionCoefficients, regressionGrid } from "./regression-solver";
+
 import { computeLinearCIComponents, confidenceCriticalValue, confidenceHalfWidth, stdErrorsAt } from "./regression-utils";
 
 /**
@@ -43,40 +45,20 @@ export function rSquared(data, x, y, uY, predict) {
 
 export 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 = computeLinearCIComponents(data, x, y, predict);
-    return {
+    const alpha = null !== (_a = null == options ? void 0 : options.alpha) && void 0 !== _a ? _a : .05, points = regressionPoints(data, x, y), model = fitRegression(points, 1), coef = regressionCoefficients(model), a = coef[0], b = coef[1], predict = xx => regressionPrediction(model, xx), comps = 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 regressionGrid(comps.min, comps.max, N, predict);
         },
         confidenceInterval: function(N = 50) {
             const out = [];

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

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/regression-linear.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,EACL,yBAAyB,EACzB,uBAAuB,EACvB,mBAAmB,EACnB,WAAW,EACZ,MAAM,oBAAoB,CAAC;AAE5B;;;GAGG;AAEH,MAAM,UAAU,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;AAED,MAAM,UAAU,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,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,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;AAED,MAAM,UAAU,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,KAAK,CAAC,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;AAED,MAAM,UAAU,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,yBAAyB,CAAC,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,uBAAuB,CAAC,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,WAAW,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC3C,MAAM,aAAa,GAAG,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,MAAM,aAAa,GAAG,mBAAmB,CAAC,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,WAAW,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACpC,MAAM,aAAa,GAAG,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,MAAM,aAAa,GAAG,mBAAmB,CAAC,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;AAED,eAAe;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,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,EACL,gBAAgB,EAChB,aAAa,EACb,oBAAoB,EACpB,sBAAsB,EACtB,cAAc,EACf,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACL,yBAAyB,EACzB,uBAAuB,EACvB,mBAAmB,EACnB,WAAW,EACZ,MAAM,oBAAoB,CAAC;AAE5B;;;GAGG;AAEH,MAAM,UAAU,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;AAED,MAAM,UAAU,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,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,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;AAED,MAAM,UAAU,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,KAAK,CAAC,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;AAED,MAAM,UAAU,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,gBAAgB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,sBAAsB,CAAC,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,oBAAoB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAChE,MAAM,KAAK,GAAG,yBAAyB,CAAC,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,cAAc,CAAC,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,uBAAuB,CAAC,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,WAAW,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC3C,MAAM,aAAa,GAAG,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,MAAM,aAAa,GAAG,mBAAmB,CAAC,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,WAAW,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACpC,MAAM,aAAa,GAAG,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,MAAM,aAAa,GAAG,mBAAmB,CAAC,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;AAED,eAAe;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/es/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;

package/es/common/regression-lowess.js

@@ -1,152 +1,123 @@
-import { visitPoints } from "./regression-linear";
+import { regressionPoints, regressionGrid, regressionBasis, normalizeRegression } from "./regression-solver";
 
-import { computeLinearCIComponents, confidenceCriticalValue, confidenceHalfWidth, stdErrorsAt } from "./regression-utils";
-
-function tricube(u) {
-    const uu = Math.abs(u);
-    if (uu >= 1) return 0;
-    const t = 1 - uu * uu * uu;
-    return t * t * t;
-}
+import { median } from "./median";
 
-/**
- * Stratified sampling to reduce data size while preserving distribution
- */ function stratifiedSample(sortedData, maxSamples) {
-    const n = sortedData.length;
-    if (n <= maxSamples) return sortedData;
-    const sampled = [], step = n / maxSamples;
-    // More aggressive sampling - use exact step size
-        for (let i = 0; i < maxSamples; i++) {
-        const idx = Math.min(Math.floor(i * step), n - 1);
-        sampled.push(sortedData[idx]);
-    }
-    return sampled;
-}
+import { computeLinearCIComponents, confidenceCriticalValue, confidenceHalfWidth, stdErrorsAt } from "./regression-utils";
 
 /**
- * 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 function regressionLowess(data, x = (d => d.x), y = (d => d.y), options = {}) {
-    var _a;
-    const span = options.span || .3, degree = 0 === options.degree ? 0 : 1, alpha = null !== (_a = options.alpha) && void 0 !== _a ? _a : .05, iterations = null == options.iterations ? 2 : options.iterations, maxSamples = options.maxSamples || 1e3, rawPoints = [];
-    visitPoints(data, x, y, ((dx, dy, index) => {
-        rawPoints.push({
-            x: dx,
-            y: dy,
-            index: index
-        });
-    })), rawPoints.sort(((a, b) => a.x - b.x));
-    // Apply sampling if needed
-    const sampledPoints = stratifiedSample(rawPoints, maxSamples), n = sampledPoints.length, ptsX = new Array(n), ptsY = new Array(n);
-    for (let i = 0; i < n; i++) ptsX[i] = sampledPoints[i].x, ptsY[i] = sampledPoints[i].y;
-    /**
-     * Optimized predictSingle using binary search on pre-sorted data
-     */    function predictSingle(x0, robustWeights) {
-        if (0 === n) return 0;
-        // Binary search to find insertion point
-                let left = 0, right = n;
+    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;
+    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 = regressionPoints(data, x, y).sort(((a, b) => a.x - b.x || a.y - b.y));
+    if (null != options.maxSamples && pts.length > options.maxSamples) {
+        const full = pts, count = options.maxSamples;
+        pts = Array.from({
+            length: count
+        }, ((_, i) => full[Math.floor(i * (full.length - 1) / (count - 1))]));
+    }
+    const n = pts.length, ptsX = pts.map((p => p.x)), ptsY = pts.map((p => p.y)), basis = regressionBasis(pts), normalizedX = ptsX.map((v => normalizeRegression(v, basis.xCenter, basis.xScale))), normalizedY = ptsY.map((v => normalizeRegression(v, basis.yCenter, basis.yScale))), count = Math.min(n, Math.max(2, Math.floor(span * n + 1e-10)));
+    let robustWeights;
+    function exact(x0) {
+        if (!n) return 0;
+        const query = normalizeRegression(x0, basis.xCenter, basis.xScale);
+        // 找到连续的最近邻窗口；相等距离选择较小的 x（ties 的 y 已排序）。
+                let left = 0, right = n - count;
         for (;left < right; ) {
-            const mid = left + right >> 1;
-            ptsX[mid] < x0 ? left = mid + 1 : right = mid;
+            const mid = left + right >>> 1, lowerDistance = x0 - ptsX[mid], upperDistance = ptsX[mid + count] - x0;
+            (Number.isFinite(lowerDistance) && Number.isFinite(upperDistance) ? lowerDistance > upperDistance : query - normalizedX[mid] > normalizedX[mid + count] - query) ? left = mid + 1 : right = mid;
         }
-        const m = Math.min(n, Math.max(2, Math.floor(span * n)));
-        // Expand by distance: equal numbers on either side need not be the nearest points.
-                let lo = left - 1, hi = left;
-        for (let count = 0; count < m; count++) lo >= 0 && (hi >= n || x0 - ptsX[lo] <= ptsX[hi] - x0) ? lo-- : hi++;
-        const actualStart = lo + 1, end = hi;
-        // Find max distance and compute weights in single pass
-        let maxDist = 0;
-        const windowSize = end - actualStart, distances = new Array(windowSize);
-        for (let i = actualStart; i < end; i++) {
-            const dist = Math.abs(ptsX[i] - x0);
-            distances[i - actualStart] = dist, dist > maxDist && (maxDist = dist);
+        let start = left, end = left + count;
+        if (ptsX[start] === ptsX[end - 1]) {
+            for (;start > 0 && ptsX[start - 1] === ptsX[start]; ) start--;
+            for (;end < n && ptsX[end] === ptsX[start]; ) end++;
         }
-        // Compute weights using pre-calculated distances
-                let sumw = 0;
-        const w = new Array(windowSize);
-        for (let i = 0; i < windowSize; i++) {
-            let wi = tricube(0 === maxDist ? 0 : distances[i] / maxDist);
-            robustWeights && null != robustWeights[actualStart + i] && (wi *= robustWeights[actualStart + i]), 
-            w[i] = wi, sumw += wi;
+        const rawRadius = Math.max(Math.abs(ptsX[start] - x0), Math.abs(ptsX[end - 1] - x0)), scaled = !Number.isFinite(rawRadius), radius = scaled ? Math.max(Math.abs(normalizedX[start] - query), Math.abs(normalizedX[end - 1] - query)) : rawRadius;
+        // 局部响应坐标不能由远处、未参与该邻域的观测决定精度。
+        let yMin = 1 / 0, yMax = -1 / 0;
+        for (let i = start; i < end; i++) yMin = Math.min(yMin, ptsY[i]), yMax = Math.max(yMax, ptsY[i]);
+        const yCenter = yMin / 2 + yMax / 2, yScale = Math.max(Math.abs(yMin - yCenter), Math.abs(yMax - yCenter)) || 1;
+        let sw = 0, sx = 0, sy = 0, sxx = 0, sxy = 0;
+        for (let i = start; i < end; i++) {
+            const z = 0 === radius ? 0 : (scaled ? normalizedX[i] - query : ptsX[i] - x0) / radius, u = Math.abs(z), t = u >= 1 ? 0 : 1 - u * u * u, w = t * t * t * (robustWeights ? robustWeights[i] : 1);
+            sw += w, sx += w * z;
+            const response = normalizeRegression(ptsY[i], yCenter, yScale);
+            sy += w * response, sxx += w * z * z, sxy += w * z * response;
         }
-        if (0 === sumw) {
-            // Fall back to the nearest y, preserving input order for equal distances.
-            let nearestIdx = 0, nearestDistance = Math.abs(ptsX[0] - x0);
-            for (let i = 1; i < n; i++) {
-                const distance = Math.abs(ptsX[i] - x0);
-                (distance < nearestDistance || distance === nearestDistance && sampledPoints[i].index < sampledPoints[nearestIdx].index) && (nearestIdx = i, 
-                nearestDistance = distance);
+        if (0 === sw) {
+            // 核边界零权重时使用最近有效观测的加权常数；等距离取均值。
+            let distance = 1 / 0, weight = 0, value = 0;
+            for (let i = 0; i < n; i++) {
+                const w = robustWeights ? robustWeights[i] : 1;
+                if (0 === w) continue;
+                const d = Math.abs(scaled ? normalizedX[i] - query : ptsX[i] - x0);
+                d < distance ? (distance = d, weight = w, value = ptsY[i]) : d === distance && (value = value * (weight / (weight + w)) + ptsY[i] * (w / (weight + w)), 
+                weight += w);
             }
-            return ptsY[nearestIdx];
+            if (0 === weight) throw new RangeError("LOWESS has no effective local observations");
+            return value;
         }
-        if (0 === degree) {
-            let s = 0;
-            for (let i = 0; i < w.length; i++) s += w[i] * ptsY[actualStart + i];
-            return s / sumw;
+        const mx = sx / sw, my = sy / sw, variance = sxx / sw - mx * mx;
+        return yCenter + yScale * (my - (0 === degree || variance <= 32 * Number.EPSILON ? 0 : (sxy / sw - mx * my) / variance) * mx);
+    }
+    // delta 不删除观测。只减少局部回归求值位置，全部残差参与重加权。
+        const anchors = [];
+    for (let i = 0; i < n && (anchors.push(i), i !== n - 1); ) {
+        let next = i + 1;
+        if (delta > 0) for (;next + 1 < n && ptsX[next + 1] - ptsX[i] <= delta; ) next++;
+        // 重复 x 一起使用同一预测；端点不能丢失。
+                for (;next + 1 < n && ptsX[next + 1] === ptsX[next]; ) next++;
+        i = next;
+    }
+    let fits = new Array(n);
+    function fitObservations() {
+        const out = new Array(n);
+        for (let a = 0; a < anchors.length; a++) {
+            const index = anchors[a];
+            if (out[index] = exact(ptsX[index]), 0 === a) continue;
+            const previous = anchors[a - 1], rawWidth = ptsX[index] - ptsX[previous], width = Number.isFinite(rawWidth) ? rawWidth : normalizedX[index] - normalizedX[previous];
+            for (let i = previous + 1; i < index; i++) {
+                const t = 0 === width ? 0 : (Number.isFinite(rawWidth) ? ptsX[i] - ptsX[previous] : normalizedX[i] - normalizedX[previous]) / width;
+                out[i] = out[previous] * (1 - t) + out[index] * t;
+            }
         }
-        // weighted linear regression on local points
-                let sw = 0, sx = 0, sy = 0, sxx = 0, sxy = 0;
-        for (let i = actualStart; i < end; i++) {
-            const idx = i - actualStart, xi = ptsX[i], yi = ptsY[i], wi = w[idx];
-            sw += wi, sx += wi * xi, sy += wi * yi, sxx += wi * xi * xi, sxy += wi * xi * yi;
+        return out;
+    }
+    for (let iteration = 0; iteration <= iterations && (fits = fitObservations(), iteration !== iterations); iteration++) {
+        const residuals = fits.map(((v, i) => {
+            const residual = ptsY[i] - v;
+            return Number.isFinite(residual) ? Math.abs(residual / basis.yScale) : Math.abs(normalizedY[i] - normalizeRegression(v, basis.yCenter, basis.yScale));
+        })), med = median(residuals.slice()), currentFits = fits;
+        robustWeights = residuals.map(((r, i) => {
+            if (0 === med) {
+                return r <= 64 * Number.EPSILON * (Math.max(Math.abs(ptsY[i]), Math.abs(currentFits[i])) / basis.yScale) ? 1 : 0;
+            }
+            const u = r / (6 * med);
+            return u >= 1 ? 0 : (1 - u * u) ** 2;
+        }));
+    }
+    function predictSingle(x0) {
+        if (0 === delta || n < 2 || x0 < ptsX[0] || x0 > ptsX[n - 1]) return exact(x0);
+        let lo = 0, hi = n - 1;
+        for (;hi - lo > 1; ) {
+            const mid = lo + hi >>> 1;
+            ptsX[mid] <= x0 ? lo = mid : hi = mid;
         }
-        const meanX = sx / sw, meanY = sy / sw, denom = sxx - sx * meanX, slope = Math.abs(denom) < 1e-12 ? 0 : (sxy - sx * meanY) / denom;
-        return meanY - slope * meanX + slope * x0;
+        if (ptsX[hi] === ptsX[lo]) return fits[lo];
+        const width = ptsX[hi] - ptsX[lo], t = Number.isFinite(width) ? (x0 - ptsX[lo]) / width : (normalizeRegression(x0, basis.xCenter, basis.xScale) - normalizedX[lo]) / (normalizedX[hi] - normalizedX[lo]);
+        return fits[lo] * (1 - t) + fits[hi] * t;
     }
     function predict(x0) {
-        if (Array.isArray(x0)) {
-            const len = x0.length, out = new Array(len);
-            for (let i = 0; i < len; i++) out[i] = predictSingle(x0[i]);
-            return out;
-        }
-        return predictSingle(x0);
+        return Array.isArray(x0) ? x0.map(predictSingle) : predictSingle(x0);
     }
     return {
         predict: predict,
         evaluate: predict,
         evaluateGrid: function(N) {
-            if (N <= 0) return [];
-            if (0 === n) return [];
-            const out = new Array(N), min = ptsX[0], max = ptsX[n - 1];
-            if (min === max) {
-                const v = predictSingle(min);
-                for (let i = 0; i < N; i++) out[i] = {
-                    x: min,
-                    y: v
-                };
-                return out;
-            }
-            const step = (max - min) / (N - 1);
-            // optionally add robust iterations
-                        let robustWeights;
-            // Disable robustness iterations for large datasets to improve performance
-            // Users can override by setting iterations explicitly
-                        const effectiveIterations = null != options.iterations ? iterations : n > 500 ? 0 : iterations;
-            if (effectiveIterations > 0) for (let iter = 0; iter < effectiveIterations; iter++) {
-                // compute fits - pre-allocate arrays
-                const fits = new Array(n), res = new Array(n);
-                for (let i = 0; i < n; i++) fits[i] = predictSingle(ptsX[i], robustWeights), res[i] = Math.abs(ptsY[i] - fits[i]);
-                // median absolute deviation
-                                const med = res.slice().sort(((a, b) => a - b))[Math.floor(n / 2)] || 0;
-                robustWeights = new Array(n);
-                for (let i = 0; i < n; i++) {
-                    const u = 0 === med ? 0 : res[i] / (6 * med), w = Math.abs(u) >= 1 ? 0 : (1 - u * u) * (1 - u * u);
-                    robustWeights[i] = w;
-                }
-            }
-            for (let i = 0; i < N; i++) {
-                const px = i === N - 1 ? max : min + step * i;
-                out[i] = {
-                    x: px,
-                    y: predictSingle(px, robustWeights)
-                };
-            }
-            return out;
+            return regressionGrid(ptsX[0], ptsX[n - 1], N, predictSingle);
         },
         confidenceInterval: function(N = 50) {
             const out = [];
@@ -183,7 +154,12 @@ function tricube(u) {
                 });
             }
             return out;
-        }
+        },
+        // 节点值按 x 排序，重复观测仍保持其统计权重。
+        fitted: pts.map(((p, i) => ({
+            x: p.x,
+            y: fits[i]
+        })))
     };
 }