@visactor/vutils 1.0.24 → 1.0.26

package/es/common/kde.js

@@ -1,8 +1,21 @@
+/**
+ * Kernel Density Estimation (KDE) utilities
+ *
+ * Exports:
+ * - Kernel functions: gaussian, epanechnikov
+ * - bandwidth selectors: scott, silverman
+ * - kde: main function to compute density estimates at provided points
+ */
+/** Gaussian kernel (standard normal) */
 export const gaussian = u => 1 / Math.sqrt(2 * Math.PI) * Math.exp(-.5 * u * u);
 
-export const epanechnikov = u => Math.abs(u) <= 1 ? .75 * (1 - u * u) : 0;
+/** Epanechnikov kernel (compact support) */ export const epanechnikov = u => Math.abs(u) <= 1 ? .75 * (1 - u * u) : 0;
 
-export function scott(n, std, dim = 1) {
+/**
+ * Bandwidth selectors
+ * - scott: h = n^{-1/(d+4)} * std
+ * - silverman: h = ( (4/(d+2))^{1/(d+4)} ) * n^{-1/(d+4)} * std
+ */ export function scott(n, std, dim = 1) {
     return n <= 0 || 0 === std ? 0 : std * Math.pow(n, -1 / (dim + 4));
 }
 
@@ -11,7 +24,9 @@ export function silverman(n, std, dim = 1) {
     return Math.pow(4 / (dim + 2), 1 / (dim + 4)) * std * Math.pow(n, -1 / (dim + 4));
 }
 
-function std(values) {
+/**
+ * Compute standard deviation for numeric array
+ */ function std(values) {
     const n = values.length;
     if (0 === n) return 0;
     let mean = 0;
@@ -25,14 +40,18 @@ function std(values) {
     return Math.sqrt(s / n);
 }
 
-export function kde(data, options = {}) {
+/**
+ * Factory: create a KDE evaluator for given data and options.
+ * Usage: const model = kde(data, options); model.evaluate(x) or model.evaluate([x1,x2])
+ */ export function kde(data, options = {}) {
     const n = data.length, kernel = options.kernel || gaussian;
     let h = options.bandwidth;
     if (!h || h <= 0) {
         const sd = std(data) || 0, method = options.bandwidthMethod || "scott";
         h = "silverman" === method ? silverman(n, sd, 1) : scott(n, sd, 1);
     }
-    if (!h || h <= 0) {
+    // if still zero (constant data), evaluator returns zeros
+        if (!h || h <= 0) {
         return {
             bandwidth: 0,
             kernel: kernel,
@@ -47,7 +66,8 @@ export function kde(data, options = {}) {
             evaluateGrid: N => {
                 const out = [];
                 if (N <= 0) return out;
-                let min = 1 / 0, max = -1 / 0;
+                // compute data min (use data range if available)
+                                let min = 1 / 0, max = -1 / 0;
                 for (let j = 0; j < n; j++) {
                     const v = data[j];
                     v < min && (min = v), v > max && (max = v);
@@ -87,13 +107,15 @@ export function kde(data, options = {}) {
         evaluateGrid(N) {
             const out = [];
             if (N <= 0) return out;
-            let min = 1 / 0, max = -1 / 0;
+            // compute data range
+                        let min = 1 / 0, max = -1 / 0;
             for (let i = 0; i < n; i++) {
                 const v = data[i];
                 v < min && (min = v), v > max && (max = v);
             }
             if (min === 1 / 0 || max === -1 / 0) return out;
             if (min === max) {
+                // single point repeated
                 for (let i = 0; i < N; i++) out.push({
                     x: min,
                     y: evalPoint(min)

package/es/common/kde.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/kde.ts"],"names":[],"mappings":"AAYA,MAAM,CAAC,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;AAGF,MAAM,CAAC,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;AAOF,MAAM,UAAU,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;AAED,MAAM,UAAU,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;AAYD,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;AAsBD,MAAM,UAAU,GAAG,CAAC,IAAc,EAAE,UAAsB,EAAE;IAC1D,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,QAAQ,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;IAGD,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;YAED,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;YAED,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;gBAEf,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;AAED,eAAe,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;AAIH,wCAAwC;AACxC,MAAM,CAAC,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;AAEF,4CAA4C;AAC5C,MAAM,CAAC,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;AAEF;;;;GAIG;AACH,MAAM,UAAU,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;AAED,MAAM,UAAU,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;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,MAAM,UAAU,GAAG,CAAC,IAAc,EAAE,UAAsB,EAAE;IAC1D,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,QAAQ,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;AAED,eAAe,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"]}

package/es/common/mean.d.ts

@@ -0,0 +1,2 @@
+/** 有限数值的均值；空输入没有均值，不修改输入。 */
+export declare function mean(values: readonly number[]): number | undefined;

package/es/common/mean.js

@@ -0,0 +1,19 @@
+/** 有限数值的均值；空输入没有均值，不修改输入。 */
+export function mean(values) {
+    if (!values.length) return;
+    let scale = 0;
+    for (const value of values) {
+        if (!Number.isFinite(value)) throw new RangeError("mean requires finite numbers");
+        scale = Math.max(scale, Math.abs(value));
+    }
+    if (0 === scale) return 0;
+    let sum = 0, correction = 0;
+    for (const value of values) {
+        const next = value / scale, total = sum + next;
+        // Neumaier compensation retains small contributions even when larger values cancel.
+        correction += Math.abs(sum) >= Math.abs(next) ? sum - total + next : next - total + sum, 
+        sum = total;
+    }
+    return (sum + correction) / values.length * scale;
+}
+//# sourceMappingURL=mean.js.map

package/es/common/mean.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/mean.ts"],"names":[],"mappings":"AAAA,6BAA6B;AAC7B,MAAM,UAAU,IAAI,CAAC,MAAyB;IAC5C,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;QAClB,OAAO,SAAS,CAAC;KAClB;IACD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QAC1B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC3B,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;SACtD;QACD,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;KAC1C;IACD,IAAI,KAAK,KAAK,CAAC,EAAE;QACf,OAAO,CAAC,CAAC;KACV;IACD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QAC1B,MAAM,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC;QAC3B,MAAM,KAAK,GAAG,GAAG,GAAG,IAAI,CAAC;QACzB,oFAAoF;QACpF,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,GAAG,GAAG,CAAC;QACxF,GAAG,GAAG,KAAK,CAAC;KACb;IACD,OAAO,CAAC,CAAC,GAAG,GAAG,UAAU,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;AACtD,CAAC","file":"mean.js","sourcesContent":["/** 有限数值的均值；空输入没有均值，不修改输入。 */\nexport function mean(values: readonly number[]): number | undefined {\n  if (!values.length) {\n    return undefined;\n  }\n  let scale = 0;\n  for (const value of values) {\n    if (!Number.isFinite(value)) {\n      throw new RangeError('mean requires finite numbers');\n    }\n    scale = Math.max(scale, Math.abs(value));\n  }\n  if (scale === 0) {\n    return 0;\n  }\n  let sum = 0;\n  let correction = 0;\n  for (const value of values) {\n    const next = value / scale;\n    const total = sum + next;\n    // Neumaier compensation retains small contributions even when larger values cancel.\n    correction += Math.abs(sum) >= Math.abs(next) ? sum - total + next : next - total + sum;\n    sum = total;\n  }\n  return ((sum + correction) / values.length) * scale;\n}\n"]}

package/es/common/merge.js

@@ -10,39 +10,56 @@ export function baseMerge(target, source, shallowArray = !1, skipTargetArray = !
     if (source) {
         if (target === source) return;
         if (isValid(source) && "object" == typeof source) {
+            // baseFor
             const iterable = Object(source), props = [];
+            // keysIn
             for (const key in iterable) props.push(key);
             let {length: length} = props, propIndex = -1;
             for (;length--; ) {
                 const key = props[++propIndex];
-                !isValid(iterable[key]) || "object" != typeof iterable[key] || skipTargetArray && isArray(target[key]) ? assignMergeValue(target, key, iterable[key]) : baseMergeDeep(target, source, key, shallowArray, skipTargetArray);
+                // skipArray 这个是vchart spec的特有逻辑
+                                !isValid(iterable[key]) || "object" != typeof iterable[key] || skipTargetArray && isArray(target[key]) ? assignMergeValue(target, key, iterable[key]) : baseMergeDeep(target, source, key, shallowArray, skipTargetArray);
             }
         }
     }
 }
 
+// 由于目前 ChartSpace 内部对 spec 会先执行一次深拷贝，merge 暂时不考虑 source 中有环的问题
+// eslint-disable-next-line @typescript-eslint/ban-types
 function baseMergeDeep(target, source, key, shallowArray = !1, skipTargetArray = !1) {
     const objValue = target[key], srcValue = source[key];
     let newValue = source[key], isCommon = !0;
+    // 不考虑 buffer / typedArray 类型
     if (isArray(srcValue)) {
-        if (shallowArray) newValue = []; else if (isArray(objValue)) newValue = objValue; else if (isArrayLike(objValue)) {
+        if (shallowArray) 
+        // 依据参数对数组做浅拷贝
+        newValue = []; else if (isArray(objValue)) newValue = objValue; else if (isArrayLike(objValue)) {
+            // 如果 source 为数组，则 target 的 arrayLike 对象也视作为数组处理
             newValue = new Array(objValue.length);
             let index = -1;
             const length = objValue.length;
             for (;++index < length; ) newValue[index] = objValue[index];
         }
-    } else isPlainObject(srcValue) ? (newValue = null != objValue ? objValue : {}, "function" != typeof objValue && "object" == typeof objValue || (newValue = {})) : isCommon = !1;
-    isCommon && baseMerge(newValue, srcValue, shallowArray, skipTargetArray), assignMergeValue(target, key, newValue);
+    } else isPlainObject(srcValue) ? (newValue = null != objValue ? objValue : {}, 
+    // 不考虑 prototype 的额外处理
+    "function" != typeof objValue && "object" == typeof objValue || (newValue = {})) : isCommon = !1;
+    // 对 class 等复杂对象或者浅拷贝的 array 不做拷贝处理
+        isCommon && baseMerge(newValue, srcValue, shallowArray, skipTargetArray), assignMergeValue(target, key, newValue);
 }
 
+// eslint-disable-next-line @typescript-eslint/ban-types
 function assignMergeValue(target, key, value) {
-    (void 0 !== value && !eq(target[key], value) || void 0 === value && !(key in target)) && (target[key] = value);
+    (void 0 !== value && !eq(target[key], value) || void 0 === value && !(key in target)) && (
+    // 不考虑 __proto__ 的赋值处理
+    target[key] = value);
 }
 
 function eq(value, other) {
     return value === other || Number.isNaN(value) && Number.isNaN(other);
 }
 
+// 与原生的 lodash merge 差异在于对数组是否应用最后一个 source 的结果
+// 例如 lineDash 等 spec 的 merge 使用这一操作更合适
 export default function merge(target, ...sources) {
     let sourceIndex = -1;
     const length = sources.length;

package/es/common/merge.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/merge.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,WAAW,MAAM,eAAe,CAAC;AACxC,OAAO,aAAa,MAAM,iBAAiB,CAAC;AAC5C,OAAO,OAAO,MAAM,WAAW,CAAC;AAEhC,MAAM,UAAU,SAAS,CAAC,MAAW,EAAE,MAAW,EAAE,eAAwB,KAAK,EAAE,kBAA2B,KAAK;IACjH,IAAI,MAAM,EAAE;QACV,IAAI,MAAM,KAAK,MAAM,EAAE;YACrB,OAAO;SACR;QACD,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;YAEjD,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,EAAE,CAAC;YAEjB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE;gBAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;aACjB;YACD,IAAI,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;YACvB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;YACnB,OAAO,MAAM,EAAE,EAAE;gBACf,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;gBAE/B,IACE,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;oBACtB,OAAO,QAAQ,CAAC,GAAG,CAAC,KAAK,QAAQ;oBACjC,CAAC,CAAC,eAAe,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAC3C;oBACA,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,EAAE,eAAe,CAAC,CAAC;iBACnE;qBAAM;oBACL,gBAAgB,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;iBAC9C;aACF;SACF;KACF;AACH,CAAC;AAID,SAAS,aAAa,CACpB,MAAc,EACd,MAAc,EACd,GAAW,EACX,eAAwB,KAAK,EAC7B,kBAA2B,KAAK;IAEhC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC7B,IAAI,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,QAAQ,GAAG,IAAI,CAAC;IAEpB,IAAI,OAAO,CAAC,QAAQ,CAAC,EAAE;QACrB,IAAI,YAAY,EAAE;YAEhB,QAAQ,GAAG,EAAE,CAAC;SACf;aAAM,IAAI,OAAO,CAAC,QAAQ,CAAC,EAAE;YAC5B,QAAQ,GAAG,QAAQ,CAAC;SACrB;aAAM,IAAI,WAAW,CAAC,QAAQ,CAAC,EAAE;YAEhC,QAAQ,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/B,OAAO,EAAE,KAAK,GAAG,MAAM,EAAE;gBACvB,QAAQ,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;aACnC;SACF;KACF;SAKI,IAAI,aAAa,CAAC,QAAQ,CAAC,EAAE;QAChC,QAAQ,GAAG,QAAQ,aAAR,QAAQ,cAAR,QAAQ,GAAI,EAAE,CAAC;QAE1B,IAAI,OAAO,QAAQ,KAAK,UAAU,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE;YAClE,QAAQ,GAAG,EAAE,CAAC;SACf;KACF;SAAM;QACL,QAAQ,GAAG,KAAK,CAAC;KAClB;IAED,IAAI,QAAQ,EAAE;QACZ,SAAS,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,eAAe,CAAC,CAAC;KAC9D;IACD,gBAAgB,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;AAC1C,CAAC;AAGD,SAAS,gBAAgB,CAAC,MAAc,EAAE,GAAW,EAAE,KAAU;IAC/D,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE;QAEjG,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;KACrB;AACH,CAAC;AAED,SAAS,EAAE,CAAC,KAAU,EAAE,KAAU;IAChC,OAAO,KAAK,KAAK,KAAK,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;AACzE,CAAC;AAID,MAAM,CAAC,OAAO,UAAU,KAAK,CAAC,MAAW,EAAE,GAAG,OAAc;IAC1D,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;IACrB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAC9B,OAAO,EAAE,WAAW,GAAG,MAAM,EAAE;QAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;QACpC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;KACjC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","file":"merge.js","sourcesContent":["import isArray from './isArray';\nimport isArrayLike from './isArrayLike';\nimport isPlainObject from './isPlainObject';\nimport isValid from './isValid';\n\nexport function baseMerge(target: any, source: any, shallowArray: boolean = false, skipTargetArray: boolean = false) {\n  if (source) {\n    if (target === source) {\n      return;\n    }\n    if (isValid(source) && typeof source === 'object') {\n      // baseFor\n      const iterable = Object(source);\n      const props = [];\n      // keysIn\n      for (const key in iterable) {\n        props.push(key);\n      }\n      let { length } = props;\n      let propIndex = -1;\n      while (length--) {\n        const key = props[++propIndex];\n        // skipArray 这个是vchart spec的特有逻辑\n        if (\n          isValid(iterable[key]) &&\n          typeof iterable[key] === 'object' &&\n          (!skipTargetArray || !isArray(target[key]))\n        ) {\n          baseMergeDeep(target, source, key, shallowArray, skipTargetArray);\n        } else {\n          assignMergeValue(target, key, iterable[key]);\n        }\n      }\n    }\n  }\n}\n\n// 由于目前 ChartSpace 内部对 spec 会先执行一次深拷贝，merge 暂时不考虑 source 中有环的问题\n// eslint-disable-next-line @typescript-eslint/ban-types\nfunction baseMergeDeep(\n  target: object,\n  source: object,\n  key: string,\n  shallowArray: boolean = false,\n  skipTargetArray: boolean = false\n) {\n  const objValue = target[key];\n  const srcValue = source[key];\n  let newValue = source[key];\n  let isCommon = true;\n  // 不考虑 buffer / typedArray 类型\n  if (isArray(srcValue)) {\n    if (shallowArray) {\n      // 依据参数对数组做浅拷贝\n      newValue = [];\n    } else if (isArray(objValue)) {\n      newValue = objValue;\n    } else if (isArrayLike(objValue)) {\n      // 如果 source 为数组，则 target 的 arrayLike 对象也视作为数组处理\n      newValue = new Array(objValue.length);\n      let index = -1;\n      const length = objValue.length;\n      while (++index < length) {\n        newValue[index] = objValue[index];\n      }\n    }\n  }\n  // else if (isArray(srcValue) && shallowArray) {\n  //   newValue = [];\n  // }\n  // 不考虑 argument 类型\n  else if (isPlainObject(srcValue)) {\n    newValue = objValue ?? {};\n    // 不考虑 prototype 的额外处理\n    if (typeof objValue === 'function' || typeof objValue !== 'object') {\n      newValue = {};\n    }\n  } else {\n    isCommon = false;\n  }\n  // 对 class 等复杂对象或者浅拷贝的 array 不做拷贝处理\n  if (isCommon) {\n    baseMerge(newValue, srcValue, shallowArray, skipTargetArray);\n  }\n  assignMergeValue(target, key, newValue);\n}\n\n// eslint-disable-next-line @typescript-eslint/ban-types\nfunction assignMergeValue(target: object, key: string, value: any) {\n  if ((value !== undefined && !eq(target[key], value)) || (value === undefined && !(key in target))) {\n    // 不考虑 __proto__ 的赋值处理\n    target[key] = value;\n  }\n}\n\nfunction eq(value: any, other: any) {\n  return value === other || (Number.isNaN(value) && Number.isNaN(other));\n}\n\n// 与原生的 lodash merge 差异在于对数组是否应用最后一个 source 的结果\n// 例如 lineDash 等 spec 的 merge 使用这一操作更合适\nexport default function merge(target: any, ...sources: any[]): any {\n  let sourceIndex = -1;\n  const length = sources.length;\n  while (++sourceIndex < length) {\n    const source = sources[sourceIndex];\n    baseMerge(target, source, true);\n  }\n  return target;\n}\n"]}
+{"version":3,"sources":["../src/common/merge.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,WAAW,MAAM,eAAe,CAAC;AACxC,OAAO,aAAa,MAAM,iBAAiB,CAAC;AAC5C,OAAO,OAAO,MAAM,WAAW,CAAC;AAEhC,MAAM,UAAU,SAAS,CAAC,MAAW,EAAE,MAAW,EAAE,eAAwB,KAAK,EAAE,kBAA2B,KAAK;IACjH,IAAI,MAAM,EAAE;QACV,IAAI,MAAM,KAAK,MAAM,EAAE;YACrB,OAAO;SACR;QACD,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;YACjD,UAAU;YACV,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,EAAE,CAAC;YACjB,SAAS;YACT,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE;gBAC1B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;aACjB;YACD,IAAI,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;YACvB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;YACnB,OAAO,MAAM,EAAE,EAAE;gBACf,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;gBAC/B,gCAAgC;gBAChC,IACE,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;oBACtB,OAAO,QAAQ,CAAC,GAAG,CAAC,KAAK,QAAQ;oBACjC,CAAC,CAAC,eAAe,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAC3C;oBACA,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,EAAE,eAAe,CAAC,CAAC;iBACnE;qBAAM;oBACL,gBAAgB,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;iBAC9C;aACF;SACF;KACF;AACH,CAAC;AAED,+DAA+D;AAC/D,wDAAwD;AACxD,SAAS,aAAa,CACpB,MAAc,EACd,MAAc,EACd,GAAW,EACX,eAAwB,KAAK,EAC7B,kBAA2B,KAAK;IAEhC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC7B,IAAI,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,QAAQ,GAAG,IAAI,CAAC;IACpB,6BAA6B;IAC7B,IAAI,OAAO,CAAC,QAAQ,CAAC,EAAE;QACrB,IAAI,YAAY,EAAE;YAChB,cAAc;YACd,QAAQ,GAAG,EAAE,CAAC;SACf;aAAM,IAAI,OAAO,CAAC,QAAQ,CAAC,EAAE;YAC5B,QAAQ,GAAG,QAAQ,CAAC;SACrB;aAAM,IAAI,WAAW,CAAC,QAAQ,CAAC,EAAE;YAChC,gDAAgD;YAChD,QAAQ,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;YACf,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;YAC/B,OAAO,EAAE,KAAK,GAAG,MAAM,EAAE;gBACvB,QAAQ,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;aACnC;SACF;KACF;IACD,gDAAgD;IAChD,mBAAmB;IACnB,IAAI;IACJ,kBAAkB;SACb,IAAI,aAAa,CAAC,QAAQ,CAAC,EAAE;QAChC,QAAQ,GAAG,QAAQ,aAAR,QAAQ,cAAR,QAAQ,GAAI,EAAE,CAAC;QAC1B,sBAAsB;QACtB,IAAI,OAAO,QAAQ,KAAK,UAAU,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE;YAClE,QAAQ,GAAG,EAAE,CAAC;SACf;KACF;SAAM;QACL,QAAQ,GAAG,KAAK,CAAC;KAClB;IACD,mCAAmC;IACnC,IAAI,QAAQ,EAAE;QACZ,SAAS,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,eAAe,CAAC,CAAC;KAC9D;IACD,gBAAgB,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;AAC1C,CAAC;AAED,wDAAwD;AACxD,SAAS,gBAAgB,CAAC,MAAc,EAAE,GAAW,EAAE,KAAU;IAC/D,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE;QACjG,sBAAsB;QACtB,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;KACrB;AACH,CAAC;AAED,SAAS,EAAE,CAAC,KAAU,EAAE,KAAU;IAChC,OAAO,KAAK,KAAK,KAAK,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;AACzE,CAAC;AAED,+CAA+C;AAC/C,uCAAuC;AACvC,MAAM,CAAC,OAAO,UAAU,KAAK,CAAC,MAAW,EAAE,GAAG,OAAc;IAC1D,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC;IACrB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAC9B,OAAO,EAAE,WAAW,GAAG,MAAM,EAAE;QAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;QACpC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;KACjC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","file":"merge.js","sourcesContent":["import isArray from './isArray';\nimport isArrayLike from './isArrayLike';\nimport isPlainObject from './isPlainObject';\nimport isValid from './isValid';\n\nexport function baseMerge(target: any, source: any, shallowArray: boolean = false, skipTargetArray: boolean = false) {\n  if (source) {\n    if (target === source) {\n      return;\n    }\n    if (isValid(source) && typeof source === 'object') {\n      // baseFor\n      const iterable = Object(source);\n      const props = [];\n      // keysIn\n      for (const key in iterable) {\n        props.push(key);\n      }\n      let { length } = props;\n      let propIndex = -1;\n      while (length--) {\n        const key = props[++propIndex];\n        // skipArray 这个是vchart spec的特有逻辑\n        if (\n          isValid(iterable[key]) &&\n          typeof iterable[key] === 'object' &&\n          (!skipTargetArray || !isArray(target[key]))\n        ) {\n          baseMergeDeep(target, source, key, shallowArray, skipTargetArray);\n        } else {\n          assignMergeValue(target, key, iterable[key]);\n        }\n      }\n    }\n  }\n}\n\n// 由于目前 ChartSpace 内部对 spec 会先执行一次深拷贝，merge 暂时不考虑 source 中有环的问题\n// eslint-disable-next-line @typescript-eslint/ban-types\nfunction baseMergeDeep(\n  target: object,\n  source: object,\n  key: string,\n  shallowArray: boolean = false,\n  skipTargetArray: boolean = false\n) {\n  const objValue = target[key];\n  const srcValue = source[key];\n  let newValue = source[key];\n  let isCommon = true;\n  // 不考虑 buffer / typedArray 类型\n  if (isArray(srcValue)) {\n    if (shallowArray) {\n      // 依据参数对数组做浅拷贝\n      newValue = [];\n    } else if (isArray(objValue)) {\n      newValue = objValue;\n    } else if (isArrayLike(objValue)) {\n      // 如果 source 为数组，则 target 的 arrayLike 对象也视作为数组处理\n      newValue = new Array(objValue.length);\n      let index = -1;\n      const length = objValue.length;\n      while (++index < length) {\n        newValue[index] = objValue[index];\n      }\n    }\n  }\n  // else if (isArray(srcValue) && shallowArray) {\n  //   newValue = [];\n  // }\n  // 不考虑 argument 类型\n  else if (isPlainObject(srcValue)) {\n    newValue = objValue ?? {};\n    // 不考虑 prototype 的额外处理\n    if (typeof objValue === 'function' || typeof objValue !== 'object') {\n      newValue = {};\n    }\n  } else {\n    isCommon = false;\n  }\n  // 对 class 等复杂对象或者浅拷贝的 array 不做拷贝处理\n  if (isCommon) {\n    baseMerge(newValue, srcValue, shallowArray, skipTargetArray);\n  }\n  assignMergeValue(target, key, newValue);\n}\n\n// eslint-disable-next-line @typescript-eslint/ban-types\nfunction assignMergeValue(target: object, key: string, value: any) {\n  if ((value !== undefined && !eq(target[key], value)) || (value === undefined && !(key in target))) {\n    // 不考虑 __proto__ 的赋值处理\n    target[key] = value;\n  }\n}\n\nfunction eq(value: any, other: any) {\n  return value === other || (Number.isNaN(value) && Number.isNaN(other));\n}\n\n// 与原生的 lodash merge 差异在于对数组是否应用最后一个 source 的结果\n// 例如 lineDash 等 spec 的 merge 使用这一操作更合适\nexport default function merge(target: any, ...sources: any[]): any {\n  let sourceIndex = -1;\n  const length = sources.length;\n  while (++sourceIndex < length) {\n    const source = sources[sourceIndex];\n    baseMerge(target, source, true);\n  }\n  return target;\n}\n"]}

package/es/common/mixin.js

@@ -1,8 +1,11 @@
+// eslint-disable-next-line @typescript-eslint/no-unnecessary-type-constraint
 export function keys(obj) {
     if (!obj) return [];
     if (Object.keys) return Object.keys(obj);
     const keyList = [];
-    for (const key in obj) obj.hasOwnProperty(key) && keyList.push(key);
+    for (const key in obj) 
+    // eslint-disable-next-line no-prototype-builtins
+    obj.hasOwnProperty(key) && keyList.push(key);
     return keyList;
 }
 
@@ -15,9 +18,17 @@ export function defaults(target, source, overlay) {
     return target;
 }
 
+// eslint-disable-next-line @typescript-eslint/ban-types
 export function mixin(target, source, override = !0) {
-    if (target = "prototype" in target ? target.prototype : target, source = "prototype" in source ? source.prototype : source, 
-    Object.getOwnPropertyNames) {
+    // If build target is ES6 class. prototype methods is not enumerable. Use getOwnPropertyNames instead
+    // TODO: Determine if source is ES6 class?
+    if (
+    // eslint-disable-next-line @typescript-eslint/ban-ts-comment
+    // @ts-ignore
+    target = "prototype" in target ? target.prototype : target, 
+    // eslint-disable-next-line @typescript-eslint/ban-ts-comment
+    // @ts-ignore
+    source = "prototype" in source ? source.prototype : source, Object.getOwnPropertyNames) {
         const keyList = Object.getOwnPropertyNames(source);
         for (let i = 0; i < keyList.length; i++) {
             const key = keyList[i];

package/es/common/mixin.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/mixin.ts"],"names":[],"mappings":"AAKA,MAAM,UAAU,IAAI,CAAgB,GAAM;IACxC,IAAI,CAAC,GAAG,EAAE;QACR,OAAO,EAAE,CAAC;KACX;IAID,IAAI,MAAM,CAAC,IAAI,EAAE;QACf,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAY,CAAC;KACpC;IACD,MAAM,OAAO,GAAY,EAAE,CAAC;IAC5B,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE;QAErB,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC3B,OAAO,CAAC,IAAI,CAAC,GAAU,CAAC,CAAC;SAC1B;KACF;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,QAAQ,CAA2C,MAAS,EAAE,MAAS,EAAE,OAAiB;IACxG,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACvC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAE,MAAgB,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE;YACjE,MAAgB,CAAC,GAAG,CAAC,GAAI,MAAgB,CAAC,GAAG,CAAC,CAAC;SACjD;KACF;IACD,OAAO,MAAe,CAAC;AACzB,CAAC;AAGD,MAAM,UAAU,KAAK,CAAO,MAAoB,EAAE,MAAoB,EAAE,WAAoB,IAAI;IAG9F,MAAM,GAAG,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC;IAG3D,MAAM,GAAG,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC;IAG3D,IAAI,MAAM,CAAC,mBAAmB,EAAE;QAC9B,MAAM,OAAO,GAAG,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,GAAG,KAAK,aAAa,EAAE;gBACzB,IAAI,QAAQ,CAAC,CAAC,CAAE,MAAc,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAE,MAAc,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE;oBACzE,MAAc,CAAC,GAAG,CAAC,GAAI,MAAc,CAAC,GAAG,CAAC,CAAC;iBAC7C;aACF;SACF;KACF;SAAM;QACL,QAAQ,CAAC,MAAmB,EAAE,MAAmB,EAAE,QAAQ,CAAC,CAAC;KAC9D;AACH,CAAC","file":"mixin.js","sourcesContent":["import type { Dict } from '../type';\n\nexport type KeyOfDistributive<T> = T extends unknown ? keyof T : never;\n\n// eslint-disable-next-line @typescript-eslint/no-unnecessary-type-constraint\nexport function keys<T extends any>(obj: T): (KeyOfDistributive<T> & string)[] {\n  if (!obj) {\n    return [];\n  }\n  // Return type should be `keyof T` but exclude `number`, becuase\n  // `Object.keys` only return string rather than `number | string`.\n  type TKeys = KeyOfDistributive<T> & string;\n  if (Object.keys) {\n    return Object.keys(obj) as TKeys[];\n  }\n  const keyList: TKeys[] = [];\n  for (const key in obj) {\n    // eslint-disable-next-line no-prototype-builtins\n    if (obj.hasOwnProperty(key)) {\n      keyList.push(key as any);\n    }\n  }\n  return keyList;\n}\n\nexport function defaults<T extends Dict<any>, S extends Dict<any>>(target: T, source: S, overlay?: boolean): T & S {\n  const keysArr = keys(source);\n  for (let i = 0; i < keysArr.length; i++) {\n    const key = keysArr[i];\n    if (overlay ? source[key] != null : (target as T & S)[key] == null) {\n      (target as S & T)[key] = (source as T & S)[key];\n    }\n  }\n  return target as T & S;\n}\n\n// eslint-disable-next-line @typescript-eslint/ban-types\nexport function mixin<T, S>(target: T | Function, source: S | Function, override: boolean = true) {\n  // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n  // @ts-ignore\n  target = 'prototype' in target ? target.prototype : target;\n  // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n  // @ts-ignore\n  source = 'prototype' in source ? source.prototype : source;\n  // If build target is ES6 class. prototype methods is not enumerable. Use getOwnPropertyNames instead\n  // TODO: Determine if source is ES6 class?\n  if (Object.getOwnPropertyNames) {\n    const keyList = Object.getOwnPropertyNames(source);\n    for (let i = 0; i < keyList.length; i++) {\n      const key = keyList[i];\n      if (key !== 'constructor') {\n        if (override ? (source as any)[key] != null : (target as any)[key] == null) {\n          (target as any)[key] = (source as any)[key];\n        }\n      }\n    }\n  } else {\n    defaults(target as Dict<any>, source as Dict<any>, override);\n  }\n}\n"]}
+{"version":3,"sources":["../src/common/mixin.ts"],"names":[],"mappings":"AAIA,6EAA6E;AAC7E,MAAM,UAAU,IAAI,CAAgB,GAAM;IACxC,IAAI,CAAC,GAAG,EAAE;QACR,OAAO,EAAE,CAAC;KACX;IAID,IAAI,MAAM,CAAC,IAAI,EAAE;QACf,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAY,CAAC;KACpC;IACD,MAAM,OAAO,GAAY,EAAE,CAAC;IAC5B,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE;QACrB,iDAAiD;QACjD,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC3B,OAAO,CAAC,IAAI,CAAC,GAAU,CAAC,CAAC;SAC1B;KACF;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,QAAQ,CAA2C,MAAS,EAAE,MAAS,EAAE,OAAiB;IACxG,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACvC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAE,MAAgB,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE;YACjE,MAAgB,CAAC,GAAG,CAAC,GAAI,MAAgB,CAAC,GAAG,CAAC,CAAC;SACjD;KACF;IACD,OAAO,MAAe,CAAC;AACzB,CAAC;AAED,wDAAwD;AACxD,MAAM,UAAU,KAAK,CAAO,MAAoB,EAAE,MAAoB,EAAE,WAAoB,IAAI;IAC9F,6DAA6D;IAC7D,aAAa;IACb,MAAM,GAAG,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3D,6DAA6D;IAC7D,aAAa;IACb,MAAM,GAAG,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3D,qGAAqG;IACrG,0CAA0C;IAC1C,IAAI,MAAM,CAAC,mBAAmB,EAAE;QAC9B,MAAM,OAAO,GAAG,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,GAAG,KAAK,aAAa,EAAE;gBACzB,IAAI,QAAQ,CAAC,CAAC,CAAE,MAAc,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAE,MAAc,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE;oBACzE,MAAc,CAAC,GAAG,CAAC,GAAI,MAAc,CAAC,GAAG,CAAC,CAAC;iBAC7C;aACF;SACF;KACF;SAAM;QACL,QAAQ,CAAC,MAAmB,EAAE,MAAmB,EAAE,QAAQ,CAAC,CAAC;KAC9D;AACH,CAAC","file":"mixin.js","sourcesContent":["import type { Dict } from '../type';\n\nexport type KeyOfDistributive<T> = T extends unknown ? keyof T : never;\n\n// eslint-disable-next-line @typescript-eslint/no-unnecessary-type-constraint\nexport function keys<T extends any>(obj: T): (KeyOfDistributive<T> & string)[] {\n  if (!obj) {\n    return [];\n  }\n  // Return type should be `keyof T` but exclude `number`, becuase\n  // `Object.keys` only return string rather than `number | string`.\n  type TKeys = KeyOfDistributive<T> & string;\n  if (Object.keys) {\n    return Object.keys(obj) as TKeys[];\n  }\n  const keyList: TKeys[] = [];\n  for (const key in obj) {\n    // eslint-disable-next-line no-prototype-builtins\n    if (obj.hasOwnProperty(key)) {\n      keyList.push(key as any);\n    }\n  }\n  return keyList;\n}\n\nexport function defaults<T extends Dict<any>, S extends Dict<any>>(target: T, source: S, overlay?: boolean): T & S {\n  const keysArr = keys(source);\n  for (let i = 0; i < keysArr.length; i++) {\n    const key = keysArr[i];\n    if (overlay ? source[key] != null : (target as T & S)[key] == null) {\n      (target as S & T)[key] = (source as T & S)[key];\n    }\n  }\n  return target as T & S;\n}\n\n// eslint-disable-next-line @typescript-eslint/ban-types\nexport function mixin<T, S>(target: T | Function, source: S | Function, override: boolean = true) {\n  // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n  // @ts-ignore\n  target = 'prototype' in target ? target.prototype : target;\n  // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n  // @ts-ignore\n  source = 'prototype' in source ? source.prototype : source;\n  // If build target is ES6 class. prototype methods is not enumerable. Use getOwnPropertyNames instead\n  // TODO: Determine if source is ES6 class?\n  if (Object.getOwnPropertyNames) {\n    const keyList = Object.getOwnPropertyNames(source);\n    for (let i = 0; i < keyList.length; i++) {\n      const key = keyList[i];\n      if (key !== 'constructor') {\n        if (override ? (source as any)[key] != null : (target as any)[key] == null) {\n          (target as any)[key] = (source as any)[key];\n        }\n      }\n    }\n  } else {\n    defaults(target as Dict<any>, source as Dict<any>, override);\n  }\n}\n"]}

package/es/common/normalQuantile.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Approximate inverse normal CDF (probit) using Acklam's algorithm.
+ * Returns z such that P(Z <= z) = p for standard normal Z.
+ */
+export declare function normalQuantile(p: number): number;

package/es/common/normalQuantile.js

@@ -0,0 +1,15 @@
+/**
+ * Approximate inverse normal CDF (probit) using Acklam's algorithm.
+ * Returns z such that P(Z <= z) = p for standard normal Z.
+ */
+export function normalQuantile(p) {
+    if (0 === p) return -1 / 0;
+    if (1 === p) return 1 / 0;
+    if (!Number.isFinite(p) || p < 0 || p > 1) return NaN;
+    const c1 = -.00778489400243029, c2 = -.322396458041136, c3 = -2.40075827716184, c4 = -2.54973253934373, c5 = 4.37466414146497, c6 = 2.93816398269878, d1 = .00778469570904146, d2 = .32246712907004, d3 = 2.445134137143, d4 = 3.75440866190742;
+    let q, r;
+    return p < .02425 ? (q = Math.sqrt(-2 * Math.log(p)), (((((c1 * q + c2) * q + c3) * q + c4) * q + c5) * q + c6) / ((((d1 * q + d2) * q + d3) * q + d4) * q + 1)) : p <= .97575 ? (q = p - .5, 
+    r = q * q, (((((-39.6968302866538 * r + 220.946098424521) * r - 275.928510446969) * r + 138.357751867269) * r - 30.6647980661472) * r + 2.50662827745924) * q / (((((-54.4760987982241 * r + 161.585836858041) * r - 155.698979859887) * r + 66.8013118877197) * r - 13.2806815528857) * r + 1)) : (q = Math.sqrt(-2 * Math.log(1 - p)), 
+    -(((((c1 * q + c2) * q + c3) * q + c4) * q + c5) * q + c6) / ((((d1 * q + d2) * q + d3) * q + d4) * q + 1));
+}
+//# sourceMappingURL=normalQuantile.js.map

package/es/common/normalQuantile.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/normalQuantile.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,CAAS;IACtC,IAAI,CAAC,KAAK,CAAC,EAAE;QACX,OAAO,CAAC,QAAQ,CAAC;KAClB;IACD,IAAI,CAAC,KAAK,CAAC,EAAE;QACX,OAAO,QAAQ,CAAC;KACjB;IACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;QACzC,OAAO,GAAG,CAAC;KACZ;IAED,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAE5B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAE7B,MAAM,EAAE,GAAG,CAAC,mBAAmB,CAAC;IAChC,MAAM,EAAE,GAAG,CAAC,iBAAiB,CAAC;IAC9B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAE5B,MAAM,EAAE,GAAG,mBAAmB,CAAC;IAC/B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,cAAc,CAAC;IAC1B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAE5B,MAAM,IAAI,GAAG,OAAO,CAAC;IACrB,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC;IAEvB,IAAI,CAAS,CAAC;IACd,IAAI,CAAS,CAAC;IAEd,IAAI,CAAC,GAAG,IAAI,EAAE;QACZ,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;KAClH;IAED,IAAI,CAAC,IAAI,KAAK,EAAE;QACd,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QACZ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CACL,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YAC/D,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CACzD,CAAC;KACH;IAED,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACtH,CAAC","file":"normalQuantile.js","sourcesContent":["/**\n * Approximate inverse normal CDF (probit) using Acklam's algorithm.\n * Returns z such that P(Z <= z) = p for standard normal Z.\n */\nexport function normalQuantile(p: number) {\n  if (p === 0) {\n    return -Infinity;\n  }\n  if (p === 1) {\n    return Infinity;\n  }\n  if (!Number.isFinite(p) || p < 0 || p > 1) {\n    return NaN;\n  }\n\n  const a1 = -39.6968302866538;\n  const a2 = 220.946098424521;\n  const a3 = -275.928510446969;\n  const a4 = 138.357751867269;\n  const a5 = -30.6647980661472;\n  const a6 = 2.50662827745924;\n\n  const b1 = -54.4760987982241;\n  const b2 = 161.585836858041;\n  const b3 = -155.698979859887;\n  const b4 = 66.8013118877197;\n  const b5 = -13.2806815528857;\n\n  const c1 = -0.00778489400243029;\n  const c2 = -0.322396458041136;\n  const c3 = -2.40075827716184;\n  const c4 = -2.54973253934373;\n  const c5 = 4.37466414146497;\n  const c6 = 2.93816398269878;\n\n  const d1 = 0.00778469570904146;\n  const d2 = 0.32246712907004;\n  const d3 = 2.445134137143;\n  const d4 = 3.75440866190742;\n\n  const pLow = 0.02425;\n  const pHigh = 1 - pLow;\n\n  let q: number;\n  let r: number;\n\n  if (p < pLow) {\n    q = Math.sqrt(-2 * Math.log(p));\n    return (((((c1 * q + c2) * q + c3) * q + c4) * q + c5) * q + c6) / ((((d1 * q + d2) * q + d3) * q + d4) * q + 1);\n  }\n\n  if (p <= pHigh) {\n    q = p - 0.5;\n    r = q * q;\n    return (\n      ((((((a1 * r + a2) * r + a3) * r + a4) * r + a5) * r + a6) * q) /\n      (((((b1 * r + b2) * r + b3) * r + b4) * r + b5) * r + 1)\n    );\n  }\n\n  q = Math.sqrt(-2 * Math.log(1 - p));\n  return -((((((c1 * q + c2) * q + c3) * q + c4) * q + c5) * q + c6) / ((((d1 * q + d2) * q + d3) * q + d4) * q + 1));\n}\n"]}

package/es/common/number.d.ts

@@ -1,3 +1,27 @@
+/**
+ * @description 处理数值相关的方法
+ */
+/**
+ * 判断两数是否接近相等，函数参数参照 python isClose 方法
+ * @param {number} a
+ * @param {number} b
+ * @param refTol 指定的相对容差比例，将乘以两数的最大值作为相对容差
+ * @param absTol 指定的绝对容差
+ */
 export declare function isNumberClose(a: number, b: number, relTol?: number, absTol?: number): boolean;
+/**
+ * 判断 a 是否大于 b，并排除容差范围
+ * @param a
+ * @param b
+ * @param relTol 指定的相对容差比例，将乘以两数的最大值作为相对容差
+ * @param absTol 指定的绝对容差
+ */
 export declare function isGreater(a: number, b: number, relTol?: number, absTol?: number): boolean;
+/**
+ * 判断 a 是否小于 b，并排除容差范围
+ * @param a
+ * @param b
+ * @param relTol 指定的相对容差比例，将乘以两数的最大值作为相对容差
+ * @param absTol 指定的绝对容差
+ */
 export declare function isLess(a: number, b: number, relTol?: number, absTol?: number): boolean;

package/es/common/number.js

@@ -1,15 +1,37 @@
+/**
+ * @description 处理数值相关的方法
+ */
 const DEFAULT_ABSOLUTE_TOLERATE = 1e-10, DEFAULT_RELATIVE_TOLERATE = 1e-10;
 
+/**
+ * 判断两数是否接近相等，函数参数参照 python isClose 方法
+ * @param {number} a
+ * @param {number} b
+ * @param refTol 指定的相对容差比例，将乘以两数的最大值作为相对容差
+ * @param absTol 指定的绝对容差
+ */
 export function isNumberClose(a, b, relTol = DEFAULT_RELATIVE_TOLERATE, absTol = DEFAULT_ABSOLUTE_TOLERATE) {
     const abs = absTol, rel = relTol * Math.max(a, b);
     return Math.abs(a - b) <= Math.max(abs, rel);
 }
 
-export function isGreater(a, b, relTol, absTol) {
+/**
+ * 判断 a 是否大于 b，并排除容差范围
+ * @param a
+ * @param b
+ * @param relTol 指定的相对容差比例，将乘以两数的最大值作为相对容差
+ * @param absTol 指定的绝对容差
+ */ export function isGreater(a, b, relTol, absTol) {
     return a > b && !isNumberClose(a, b, relTol, absTol);
 }
 
-export function isLess(a, b, relTol, absTol) {
+/**
+ * 判断 a 是否小于 b，并排除容差范围
+ * @param a
+ * @param b
+ * @param relTol 指定的相对容差比例，将乘以两数的最大值作为相对容差
+ * @param absTol 指定的绝对容差
+ */ export function isLess(a, b, relTol, absTol) {
     return a < b && !isNumberClose(a, b, relTol, absTol);
 }
 //# sourceMappingURL=number.js.map

package/es/common/number.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/number.ts"],"names":[],"mappings":"AAIA,MAAM,yBAAyB,GAAG,KAAK,CAAC;AACxC,MAAM,yBAAyB,GAAG,KAAK,CAAC;AASxC,MAAM,UAAU,aAAa,CAC3B,CAAS,EACT,CAAS,EACT,SAAiB,yBAAyB,EAC1C,SAAiB,yBAAyB;IAE1C,MAAM,GAAG,GAAG,MAAM,CAAC;IACnB,MAAM,GAAG,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC/C,CAAC;AASD,MAAM,UAAU,SAAS,CAAC,CAAS,EAAE,CAAS,EAAE,MAAe,EAAE,MAAe;IAC9E,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AACvD,CAAC;AASD,MAAM,UAAU,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,MAAe,EAAE,MAAe;IAC3E,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AACvD,CAAC","file":"number.js","sourcesContent":["/**\n * @description 处理数值相关的方法\n */\n\nconst DEFAULT_ABSOLUTE_TOLERATE = 1e-10;\nconst DEFAULT_RELATIVE_TOLERATE = 1e-10;\n\n/**\n * 判断两数是否接近相等，函数参数参照 python isClose 方法\n * @param {number} a\n * @param {number} b\n * @param refTol 指定的相对容差比例，将乘以两数的最大值作为相对容差\n * @param absTol 指定的绝对容差\n */\nexport function isNumberClose(\n  a: number,\n  b: number,\n  relTol: number = DEFAULT_RELATIVE_TOLERATE,\n  absTol: number = DEFAULT_ABSOLUTE_TOLERATE\n) {\n  const abs = absTol;\n  const rel = relTol * Math.max(a, b);\n  return Math.abs(a - b) <= Math.max(abs, rel);\n}\n\n/**\n * 判断 a 是否大于 b，并排除容差范围\n * @param a\n * @param b\n * @param relTol 指定的相对容差比例，将乘以两数的最大值作为相对容差\n * @param absTol 指定的绝对容差\n */\nexport function isGreater(a: number, b: number, relTol?: number, absTol?: number) {\n  return a > b && !isNumberClose(a, b, relTol, absTol);\n}\n\n/**\n * 判断 a 是否小于 b，并排除容差范围\n * @param a\n * @param b\n * @param relTol 指定的相对容差比例，将乘以两数的最大值作为相对容差\n * @param absTol 指定的绝对容差\n */\nexport function isLess(a: number, b: number, relTol?: number, absTol?: number) {\n  return a < b && !isNumberClose(a, b, relTol, absTol);\n}\n"]}
+{"version":3,"sources":["../src/common/number.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,MAAM,yBAAyB,GAAG,KAAK,CAAC;AACxC,MAAM,yBAAyB,GAAG,KAAK,CAAC;AAExC;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAC3B,CAAS,EACT,CAAS,EACT,SAAiB,yBAAyB,EAC1C,SAAiB,yBAAyB;IAE1C,MAAM,GAAG,GAAG,MAAM,CAAC;IACnB,MAAM,GAAG,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC/C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS,EAAE,CAAS,EAAE,MAAe,EAAE,MAAe;IAC9E,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AACvD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,MAAe,EAAE,MAAe;IAC3E,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AACvD,CAAC","file":"number.js","sourcesContent":["/**\n * @description 处理数值相关的方法\n */\n\nconst DEFAULT_ABSOLUTE_TOLERATE = 1e-10;\nconst DEFAULT_RELATIVE_TOLERATE = 1e-10;\n\n/**\n * 判断两数是否接近相等，函数参数参照 python isClose 方法\n * @param {number} a\n * @param {number} b\n * @param refTol 指定的相对容差比例，将乘以两数的最大值作为相对容差\n * @param absTol 指定的绝对容差\n */\nexport function isNumberClose(\n  a: number,\n  b: number,\n  relTol: number = DEFAULT_RELATIVE_TOLERATE,\n  absTol: number = DEFAULT_ABSOLUTE_TOLERATE\n) {\n  const abs = absTol;\n  const rel = relTol * Math.max(a, b);\n  return Math.abs(a - b) <= Math.max(abs, rel);\n}\n\n/**\n * 判断 a 是否大于 b，并排除容差范围\n * @param a\n * @param b\n * @param relTol 指定的相对容差比例，将乘以两数的最大值作为相对容差\n * @param absTol 指定的绝对容差\n */\nexport function isGreater(a: number, b: number, relTol?: number, absTol?: number) {\n  return a > b && !isNumberClose(a, b, relTol, absTol);\n}\n\n/**\n * 判断 a 是否小于 b，并排除容差范围\n * @param a\n * @param b\n * @param relTol 指定的相对容差比例，将乘以两数的最大值作为相对容差\n * @param absTol 指定的绝对容差\n */\nexport function isLess(a: number, b: number, relTol?: number, absTol?: number) {\n  return a < b && !isNumberClose(a, b, relTol, absTol);\n}\n"]}

package/es/common/pad.d.ts

@@ -1,2 +1,23 @@
+/**
+ * Pads `string` on the left and right, left or right sides if it's shorter than `length`.
+ * Padding characters are truncated if they can't be evenly divided by `length`.
+ *
+ * @since 3.0.0
+ * @category String
+ * @param {string} [string=''] The string to pad.
+ * @param {number} [length=0] The padding length.
+ * @param {string} [chars=' '] The string used as padding.
+ * @returns {string} Returns the padded string.
+ * @example
+ *
+ * pad('abc', 8)
+ * // => '  abc   '
+ *
+ * pad('abc', 8, '_-')
+ * // => '_-abc_-_'
+ *
+ * pad('abc', 2)
+ * // => 'abc'
+ */
 declare const pad: (str: string | number, length: number, padChar?: string, align?: string) => string;
 export default pad;

package/es/common/pad.js

@@ -7,5 +7,25 @@ const repeat = (str, repeatCount = 0) => {
     return n <= 0 ? s : "left" === align ? repeat(c, n) + s : "center" === align ? repeat(c, Math.floor(n / 2)) + s + repeat(c, Math.ceil(n / 2)) : s + repeat(c, n);
 };
 
-export default pad;
+/**
+ * Pads `string` on the left and right, left or right sides if it's shorter than `length`.
+ * Padding characters are truncated if they can't be evenly divided by `length`.
+ *
+ * @since 3.0.0
+ * @category String
+ * @param {string} [string=''] The string to pad.
+ * @param {number} [length=0] The padding length.
+ * @param {string} [chars=' '] The string used as padding.
+ * @returns {string} Returns the padded string.
+ * @example
+ *
+ * pad('abc', 8)
+ * // => '  abc   '
+ *
+ * pad('abc', 8, '_-')
+ * // => '_-abc_-_'
+ *
+ * pad('abc', 2)
+ * // => 'abc'
+ */ export default pad;
 //# sourceMappingURL=pad.js.map

package/es/common/pad.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/pad.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,GAAG,CAAC,GAAoB,EAAE,cAAsB,CAAC,EAAE,EAAE;IAC/D,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC;IACxB,OAAO,CAAC,IAAI,CAAC,EAAE;QACb,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC;QACjB,CAAC,IAAI,CAAC,CAAC;KACR;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAuBF,MAAM,GAAG,GAAG,CAAC,GAAoB,EAAE,MAAc,EAAE,UAAkB,GAAG,EAAE,QAAgB,OAAO,EAAE,EAAE;IACnG,MAAM,CAAC,GAAG,OAAO,CAAC;IAClB,MAAM,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC;IACnB,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IAE5B,IAAI,CAAC,IAAI,CAAC,EAAE;QACV,OAAO,CAAC,CAAC;KACV;IAED,IAAI,KAAK,KAAK,MAAM,EAAE;QACpB,OAAO,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;KACzB;IAED,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChH,CAAC,CAAC;AAEF,eAAe,GAAG,CAAC","file":"pad.js","sourcesContent":["const repeat = (str: string | number, repeatCount: number = 0) => {\n  let s = '';\n  let i = repeatCount - 1;\n  while (i >= 0) {\n    s = `${s}${str}`;\n    i -= 1;\n  }\n  return s;\n};\n\n/**\n * Pads `string` on the left and right, left or right sides if it's shorter than `length`.\n * Padding characters are truncated if they can't be evenly divided by `length`.\n *\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * pad('abc', 8)\n * // => '  abc   '\n *\n * pad('abc', 8, '_-')\n * // => '_-abc_-_'\n *\n * pad('abc', 2)\n * // => 'abc'\n */\nconst pad = (str: string | number, length: number, padChar: string = ' ', align: string = 'right') => {\n  const c = padChar;\n  const s = str + '';\n  const n = length - s.length;\n\n  if (n <= 0) {\n    return s;\n  }\n\n  if (align === 'left') {\n    return repeat(c, n) + s;\n  }\n\n  return align === 'center' ? repeat(c, Math.floor(n / 2)) + s + repeat(c, Math.ceil(n / 2)) : s + repeat(c, n);\n};\n\nexport default pad;\n"]}
+{"version":3,"sources":["../src/common/pad.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,GAAG,CAAC,GAAoB,EAAE,cAAsB,CAAC,EAAE,EAAE;IAC/D,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC;IACxB,OAAO,CAAC,IAAI,CAAC,EAAE;QACb,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC;QACjB,CAAC,IAAI,CAAC,CAAC;KACR;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,GAAG,GAAG,CAAC,GAAoB,EAAE,MAAc,EAAE,UAAkB,GAAG,EAAE,QAAgB,OAAO,EAAE,EAAE;IACnG,MAAM,CAAC,GAAG,OAAO,CAAC;IAClB,MAAM,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC;IACnB,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IAE5B,IAAI,CAAC,IAAI,CAAC,EAAE;QACV,OAAO,CAAC,CAAC;KACV;IAED,IAAI,KAAK,KAAK,MAAM,EAAE;QACpB,OAAO,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;KACzB;IAED,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChH,CAAC,CAAC;AAEF,eAAe,GAAG,CAAC","file":"pad.js","sourcesContent":["const repeat = (str: string | number, repeatCount: number = 0) => {\n  let s = '';\n  let i = repeatCount - 1;\n  while (i >= 0) {\n    s = `${s}${str}`;\n    i -= 1;\n  }\n  return s;\n};\n\n/**\n * Pads `string` on the left and right, left or right sides if it's shorter than `length`.\n * Padding characters are truncated if they can't be evenly divided by `length`.\n *\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to pad.\n * @param {number} [length=0] The padding length.\n * @param {string} [chars=' '] The string used as padding.\n * @returns {string} Returns the padded string.\n * @example\n *\n * pad('abc', 8)\n * // => '  abc   '\n *\n * pad('abc', 8, '_-')\n * // => '_-abc_-_'\n *\n * pad('abc', 2)\n * // => 'abc'\n */\nconst pad = (str: string | number, length: number, padChar: string = ' ', align: string = 'right') => {\n  const c = padChar;\n  const s = str + '';\n  const n = length - s.length;\n\n  if (n <= 0) {\n    return s;\n  }\n\n  if (align === 'left') {\n    return repeat(c, n) + s;\n  }\n\n  return align === 'center' ? repeat(c, Math.floor(n / 2)) + s + repeat(c, Math.ceil(n / 2)) : s + repeat(c, n);\n};\n\nexport default pad;\n"]}

package/es/common/random.d.ts

@@ -1,3 +1,6 @@
 export declare function seedRandom(seed: number): number;
 export declare function randomLCG(initS?: number): () => number;
+/**
+ * 随机拟合
+ */
 export declare const fakeRandom: () => () => number;

package/es/common/random.js

@@ -2,14 +2,26 @@ export function seedRandom(seed) {
     return parseFloat("0." + Math.sin(seed).toString().substring(6));
 }
 
+/* Adapted from vega by University of Washington Interactive Data Lab
+ * https://vega.github.io/vega/
+ * Licensed under the BSD-3-Clause
+
+ * url: https://github.com/vega/vega/blob/main/packages/vega-statistics/src/lcg.js
+ * License: https://github.com/vega/vega/blob/main/LICENSE
+ * @license
+ */
+// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use
 const a = 1664525, c = 1013904223, m = 4294967296;
 
+// 2^32
 export function randomLCG(initS = 1) {
     let s = initS;
     return () => (s = (a * s + c) % m) / m;
 }
 
-export const fakeRandom = () => {
+/**
+ * 随机拟合
+ */ export const fakeRandom = () => {
     let i = -1;
     const arr = [ 0, .1, .2, .3, .4, .5, .6, .7, .8, .9 ];
     return () => (i = (i + 1) % arr.length, arr[i]);

package/es/common/random.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/random.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,OAAO,UAAU,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAYD,MAAM,CAAC,GAAG,OAAO,CAAC;AAClB,MAAM,CAAC,GAAG,UAAU,CAAC;AACrB,MAAM,CAAC,GAAG,UAAU,CAAC;AAErB,MAAM,UAAU,SAAS,CAAC,QAAgB,CAAC;IACzC,IAAI,CAAC,GAAG,KAAK,CAAC;IACd,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AACzC,CAAC;AAKD,MAAM,CAAC,MAAM,UAAU,GAAG,GAAG,EAAE;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACX,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC7D,OAAO,GAAG,EAAE;QACV,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;QACzB,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC,CAAC;AACJ,CAAC,CAAC","file":"random.js","sourcesContent":["export function seedRandom(seed: number) {\n  return parseFloat('0.' + Math.sin(seed).toString().substring(6));\n}\n\n/* Adapted from vega by University of Washington Interactive Data Lab\n * https://vega.github.io/vega/\n * Licensed under the BSD-3-Clause\n\n * url: https://github.com/vega/vega/blob/main/packages/vega-statistics/src/lcg.js\n * License: https://github.com/vega/vega/blob/main/LICENSE\n * @license\n */\n\n// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst a = 1664525;\nconst c = 1013904223;\nconst m = 4294967296; // 2^32\n\nexport function randomLCG(initS: number = 1) {\n  let s = initS;\n  return () => (s = (a * s + c) % m) / m;\n}\n\n/**\n * 随机拟合\n */\nexport const fakeRandom = () => {\n  let i = -1;\n  const arr = [0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9];\n  return () => {\n    i = (i + 1) % arr.length;\n    return arr[i];\n  };\n};\n"]}
+{"version":3,"sources":["../src/common/random.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,UAAU,CAAC,IAAY;IACrC,OAAO,UAAU,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAED;;;;;;;GAOG;AAEH,uFAAuF;AACvF,MAAM,CAAC,GAAG,OAAO,CAAC;AAClB,MAAM,CAAC,GAAG,UAAU,CAAC;AACrB,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,OAAO;AAE7B,MAAM,UAAU,SAAS,CAAC,QAAgB,CAAC;IACzC,IAAI,CAAC,GAAG,KAAK,CAAC;IACd,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,GAAG,EAAE;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACX,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC7D,OAAO,GAAG,EAAE;QACV,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;QACzB,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC,CAAC;AACJ,CAAC,CAAC","file":"random.js","sourcesContent":["export function seedRandom(seed: number) {\n  return parseFloat('0.' + Math.sin(seed).toString().substring(6));\n}\n\n/* Adapted from vega by University of Washington Interactive Data Lab\n * https://vega.github.io/vega/\n * Licensed under the BSD-3-Clause\n\n * url: https://github.com/vega/vega/blob/main/packages/vega-statistics/src/lcg.js\n * License: https://github.com/vega/vega/blob/main/LICENSE\n * @license\n */\n\n// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst a = 1664525;\nconst c = 1013904223;\nconst m = 4294967296; // 2^32\n\nexport function randomLCG(initS: number = 1) {\n  let s = initS;\n  return () => (s = (a * s + c) % m) / m;\n}\n\n/**\n * 随机拟合\n */\nexport const fakeRandom = () => {\n  let i = -1;\n  const arr = [0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9];\n  return () => {\n    i = (i + 1) % arr.length;\n    return arr[i];\n  };\n};\n"]}

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"]}