@visactor/vutils 1.0.24 → 1.0.26

package/cjs/common/cloneDeep.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/cloneDeep.ts"],"names":[],"mappings":";;;;;AAAA,wDAAgC;AAChC,4DAAoC;AACpC,sDAA8B;AAC9B,0DAAkC;AAClC,0DAAkC;AAClC,wDAAgC;AAEhC,SAAwB,SAAS,CAAC,KAAU,EAAE,UAAoC,EAAE,WAAsB;IACxG,IAAI,MAAM,CAAC;IACX,IAAI,CAAC,IAAA,iBAAO,EAAC,KAAK,CAAC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE;QACrF,OAAO,KAAK,CAAC;KACd;IAED,MAAM,KAAK,GAAG,IAAA,iBAAO,EAAC,KAAK,CAAC,CAAC;IAC7B,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE5B,IAAI,KAAK,EAAE;QACT,MAAM,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;KAC5B;SAEI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QAClC,MAAM,GAAG,EAAE,CAAC;KACb;SAEI,IAAI,IAAA,mBAAS,EAAC,KAAK,CAAC,IAAI,IAAA,kBAAQ,EAAC,KAAK,CAAC,IAAI,IAAA,kBAAQ,EAAC,KAAK,CAAC,EAAE;QAC/D,MAAM,GAAG,KAAK,CAAC;KAChB;SAAM,IAAI,IAAA,gBAAM,EAAC,KAAK,CAAC,EAAE;QACxB,MAAM,GAAG,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;KAC3B;SAEI;QACH,MAAM,GAAG,SAAS,CAAC;KACpB;IAKD,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAE7D,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,IAAI,MAAM,EAAE;QACV,OAAO,EAAE,KAAK,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE;YACxC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YAE5B,IAAI,WAAW,IAAI,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,EAAE;gBACvD,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;aACxB;iBAAM;gBACL,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,QAAQ,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;aAC5D;SACF;KACF;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AA9CD,4BA8CC","file":"cloneDeep.js","sourcesContent":["import isArray from './isArray';\nimport isBoolean from './isBoolean';\nimport isDate from './isDate';\nimport isNumber from './isNumber';\nimport isString from './isString';\nimport isValid from './isValid';\n\nexport default function cloneDeep(value: any, ignoreWhen?: (value: any) => boolean, excludeKeys?: string[]): any {\n  let result;\n  if (!isValid(value) || typeof value !== 'object' || (ignoreWhen && ignoreWhen(value))) {\n    return value;\n  }\n\n  const isArr = isArray(value);\n  const length = value.length;\n  // 不考虑特殊数组的额外处理\n  if (isArr) {\n    result = new Array(length);\n  }\n  // 不考虑 buffer / arguments 类型的处理以及 prototype 的额外处理\n  else if (typeof value === 'object') {\n    result = {};\n  }\n  // 不建议使用作为 Boolean / Number / String 作为构造器\n  else if (isBoolean(value) || isNumber(value) || isString(value)) {\n    result = value;\n  } else if (isDate(value)) {\n    result = new Date(+value);\n  }\n  // 不考虑 ArrayBuffer / DataView / TypedArray / map / set / regexp / symbol 类型\n  else {\n    result = undefined;\n  }\n\n  // 不考虑 map / set / TypedArray 类型的赋值\n\n  // 不考虑对象的 symbol 属性\n  const props = isArr ? undefined : Object.keys(Object(value));\n\n  let index = -1;\n  if (result) {\n    while (++index < (props || value).length) {\n      const key = props ? props[index] : index;\n      const subValue = value[key];\n\n      if (excludeKeys && excludeKeys.includes(key.toString())) {\n        result[key] = subValue;\n      } else {\n        result[key] = cloneDeep(subValue, ignoreWhen, excludeKeys);\n      }\n    }\n  }\n  return result;\n}\n"]}
+{"version":3,"sources":["../src/common/cloneDeep.ts"],"names":[],"mappings":";;;;;AAAA,wDAAgC;AAChC,4DAAoC;AACpC,sDAA8B;AAC9B,0DAAkC;AAClC,0DAAkC;AAClC,wDAAgC;AAEhC,SAAwB,SAAS,CAAC,KAAU,EAAE,UAAoC,EAAE,WAAsB;IACxG,IAAI,MAAM,CAAC;IACX,IAAI,CAAC,IAAA,iBAAO,EAAC,KAAK,CAAC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE;QACrF,OAAO,KAAK,CAAC;KACd;IAED,MAAM,KAAK,GAAG,IAAA,iBAAO,EAAC,KAAK,CAAC,CAAC;IAC7B,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,eAAe;IACf,IAAI,KAAK,EAAE;QACT,MAAM,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;KAC5B;IACD,iDAAiD;SAC5C,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QAClC,MAAM,GAAG,EAAE,CAAC;KACb;IACD,0CAA0C;SACrC,IAAI,IAAA,mBAAS,EAAC,KAAK,CAAC,IAAI,IAAA,kBAAQ,EAAC,KAAK,CAAC,IAAI,IAAA,kBAAQ,EAAC,KAAK,CAAC,EAAE;QAC/D,MAAM,GAAG,KAAK,CAAC;KAChB;SAAM,IAAI,IAAA,gBAAM,EAAC,KAAK,CAAC,EAAE;QACxB,MAAM,GAAG,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;KAC3B;IACD,2EAA2E;SACtE;QACH,MAAM,GAAG,SAAS,CAAC;KACpB;IAED,mCAAmC;IAEnC,mBAAmB;IACnB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAE7D,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,IAAI,MAAM,EAAE;QACV,OAAO,EAAE,KAAK,GAAG,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE;YACxC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YAE5B,IAAI,WAAW,IAAI,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,EAAE;gBACvD,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;aACxB;iBAAM;gBACL,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,QAAQ,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;aAC5D;SACF;KACF;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AA9CD,4BA8CC","file":"cloneDeep.js","sourcesContent":["import isArray from './isArray';\nimport isBoolean from './isBoolean';\nimport isDate from './isDate';\nimport isNumber from './isNumber';\nimport isString from './isString';\nimport isValid from './isValid';\n\nexport default function cloneDeep(value: any, ignoreWhen?: (value: any) => boolean, excludeKeys?: string[]): any {\n  let result;\n  if (!isValid(value) || typeof value !== 'object' || (ignoreWhen && ignoreWhen(value))) {\n    return value;\n  }\n\n  const isArr = isArray(value);\n  const length = value.length;\n  // 不考虑特殊数组的额外处理\n  if (isArr) {\n    result = new Array(length);\n  }\n  // 不考虑 buffer / arguments 类型的处理以及 prototype 的额外处理\n  else if (typeof value === 'object') {\n    result = {};\n  }\n  // 不建议使用作为 Boolean / Number / String 作为构造器\n  else if (isBoolean(value) || isNumber(value) || isString(value)) {\n    result = value;\n  } else if (isDate(value)) {\n    result = new Date(+value);\n  }\n  // 不考虑 ArrayBuffer / DataView / TypedArray / map / set / regexp / symbol 类型\n  else {\n    result = undefined;\n  }\n\n  // 不考虑 map / set / TypedArray 类型的赋值\n\n  // 不考虑对象的 symbol 属性\n  const props = isArr ? undefined : Object.keys(Object(value));\n\n  let index = -1;\n  if (result) {\n    while (++index < (props || value).length) {\n      const key = props ? props[index] : index;\n      const subValue = value[key];\n\n      if (excludeKeys && excludeKeys.includes(key.toString())) {\n        result[key] = subValue;\n      } else {\n        result[key] = cloneDeep(subValue, ignoreWhen, excludeKeys);\n      }\n    }\n  }\n  return result;\n}\n"]}

package/cjs/common/correlation.d.ts

@@ -0,0 +1,3 @@
+export type CorrelationMethod = 'pearson' | 'spearman' | 'kendall';
+/** 等长有限样本的相关系数；常量/不足两条返回 undefined，不修改数组。 */
+export declare function correlation(x: readonly number[], y: readonly number[], method?: CorrelationMethod): number | undefined;

package/cjs/common/correlation.js

@@ -0,0 +1,83 @@
+"use strict";
+
+function pearson(x, y) {
+    let sx = 0, sy = 0;
+    for (let i = 0; i < x.length; i++) sx = Math.max(sx, Math.abs(x[i])), sy = Math.max(sy, Math.abs(y[i]));
+    if (!sx || !sy) return;
+    let mx = 0, my = 0, cx = 0, cy = 0;
+    for (let i = 0; i < x.length; i++) {
+        const vx = x[i] / sx - cx, vy = y[i] / sy - cy, tx = mx + vx, ty = my + vy;
+        cx = tx - mx - vx, cy = ty - my - vy, mx = tx, my = ty;
+    }
+    mx /= x.length, my /= x.length;
+    let xx = 0, yy = 0, xy = 0;
+    for (let i = 0; i < x.length; i++) {
+        const dx = x[i] / sx - mx, dy = y[i] / sy - my;
+        xx += dx * dx, yy += dy * dy, xy += dx * dy;
+    }
+    if (0 === xx || 0 === yy) return;
+    const result = xy / Math.sqrt(xx * yy);
+    // 仅修正浮点舍入越过理论端点的几个 ulp。
+        return Math.abs(result) > 1 && Math.abs(result) <= 1 + 8 * Number.EPSILON ? Math.sign(result) : result;
+}
+
+function ranks(values) {
+    const order = values.map(((value, index) => ({
+        value: value,
+        index: index
+    }))).sort(((a, b) => a.value - b.value)), result = new Array(values.length);
+    for (let start = 0; start < order.length; ) {
+        let end = start + 1;
+        for (;end < order.length && order[end].value === order[start].value; ) end++;
+        const rank = (start + end + 1) / 2;
+        for (let i = start; i < end; i++) result[order[i].index] = rank;
+        start = end;
+    }
+    return result;
+}
+
+function kendall(x, y) {
+    const pairs = x.map(((value, index) => ({
+        x: value,
+        y: y[index]
+    }))).sort(((a, b) => a.x - b.x || a.y - b.y)), sortedY = [ ...y ].sort(((a, b) => a - b)), yRanks = new Map;
+    let tiesY = 0;
+    for (let start = 0; start < sortedY.length; ) {
+        let end = start + 1;
+        for (;end < sortedY.length && sortedY[end] === sortedY[start]; ) end++;
+        tiesY += (end - start) * (end - start - 1) / 2, yRanks.set(sortedY[start], yRanks.size + 1), 
+        start = end;
+    }
+    const tree = new Float64Array(yRanks.size + 1);
+    let tiesX = 0, tiesBoth = 0, discordant = 0;
+    for (let start = 0; start < pairs.length; ) {
+        let end = start + 1;
+        for (;end < pairs.length && pairs[end].x === pairs[start].x; ) end++;
+        tiesX += (end - start) * (end - start - 1) / 2;
+        for (let i = start; i < end; ) {
+            let j = i + 1;
+            for (;j < end && pairs[j].y === pairs[i].y; ) j++;
+            tiesBoth += (j - i) * (j - i - 1) / 2, i = j;
+        }
+        // 同 x 组先查询再更新，避免将 x ties 算成逆序。
+                for (let i = start; i < end; i++) {
+            let lessOrEqual = 0;
+            for (let rank = yRanks.get(pairs[i].y); rank > 0; rank -= rank & -rank) lessOrEqual += tree[rank];
+            discordant += start - lessOrEqual;
+        }
+        for (let i = start; i < end; i++) for (let rank = yRanks.get(pairs[i].y); rank < tree.length; rank += rank & -rank) tree[rank]++;
+        start = end;
+    }
+    const total = x.length * (x.length - 1) / 2;
+    if (total !== tiesX && total !== tiesY) return (total - tiesX - tiesY + tiesBoth - 2 * discordant) / Math.sqrt((total - tiesX) * (total - tiesY));
+}
+
+/** 等长有限样本的相关系数；常量/不足两条返回 undefined，不修改数组。 */ function correlation(x, y, method = "pearson") {
+    if (x.length !== y.length || ![ "pearson", "spearman", "kendall" ].includes(method) || x.some((value => !Number.isFinite(value))) || y.some((value => !Number.isFinite(value)))) throw new RangeError("correlation requires equal finite arrays and a supported method");
+    if (!(x.length < 2)) return "kendall" === method ? kendall(x, y) : "spearman" === method ? pearson(ranks(x), ranks(y)) : pearson(x, y);
+}
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+}), exports.correlation = void 0, exports.correlation = correlation;
+//# sourceMappingURL=correlation.js.map

package/cjs/common/correlation.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/correlation.ts"],"names":[],"mappings":";;;AAEA,SAAS,OAAO,CAAC,CAAoB,EAAE,CAAoB;IACzD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACjC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACnC;IACD,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE;QACd,OAAO,SAAS,CAAC;KAClB;IACD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACjC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAC1B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAClB,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAClB,EAAE,GAAG,EAAE,CAAC;QACR,EAAE,GAAG,EAAE,CAAC;KACT;IACD,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;IACf,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC;IACf,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACjC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAC1B,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;QACd,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;QACd,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;KACf;IACD,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;QACxB,OAAO,SAAS,CAAC;KAClB;IACD,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACvC,wBAAwB;IACxB,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE;QACtE,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KAC1B;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,KAAK,CAAC,MAAyB;IACtC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACjG,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,MAAM,CAAC,CAAC;IAChD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,GAAI;QAC1C,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;QACpB,OAAO,GAAG,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE;YACpE,GAAG,EAAE,CAAC;SACP;QACD,MAAM,IAAI,GAAG,CAAC,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAChC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;SAC/B;QACD,KAAK,GAAG,GAAG,CAAC;KACb;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,OAAO,CAAC,CAAoB,EAAE,CAAoB;IACzD,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,GAAI;QAC5C,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;QACpB,OAAO,GAAG,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,OAAO,CAAC,KAAK,CAAC,EAAE;YAC9D,GAAG,EAAE,CAAC;SACP;QACD,KAAK,IAAI,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC5C,KAAK,GAAG,GAAG,CAAC;KACb;IACD,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IAC/C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,GAAI;QAC1C,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;QACpB,OAAO,GAAG,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YAC5D,GAAG,EAAE,CAAC;SACP;QACD,KAAK,IAAI,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,GAAI;YAC7B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,OAAO,CAAC,GAAG,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;gBAC3C,CAAC,EAAE,CAAC;aACL;YACD,QAAQ,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACxC,CAAC,GAAG,CAAC,CAAC;SACP;QACD,+BAA+B;QAC/B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAChC,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,KAAK,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE;gBACvE,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;aAC3B;YACD,UAAU,IAAI,KAAK,GAAG,WAAW,CAAC;SACnC;QACD,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAChC,KAAK,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE;gBACjF,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;aACd;SACF;QACD,KAAK,GAAG,GAAG,CAAC;KACb;IACD,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC9C,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE;QACtC,OAAO,SAAS,CAAC;KAClB;IACD,OAAO,CAAC,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,QAAQ,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;AAC5G,CAAC;AAED,6CAA6C;AAC7C,SAAgB,WAAW,CACzB,CAAoB,EACpB,CAAoB,EACpB,SAA4B,SAAS;IAErC,IACE,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QACrB,CAAC,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;QACpD,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EACxC;QACA,MAAM,IAAI,UAAU,CAAC,iEAAiE,CAAC,CAAC;KACzF;IACD,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;QAChB,OAAO,SAAS,CAAC;KAClB;IACD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpH,CAAC;AAjBD,kCAiBC","file":"correlation.js","sourcesContent":["export type CorrelationMethod = 'pearson' | 'spearman' | 'kendall';\n\nfunction pearson(x: readonly number[], y: readonly number[]): number | undefined {\n  let sx = 0;\n  let sy = 0;\n  for (let i = 0; i < x.length; i++) {\n    sx = Math.max(sx, Math.abs(x[i]));\n    sy = Math.max(sy, Math.abs(y[i]));\n  }\n  if (!sx || !sy) {\n    return undefined;\n  }\n  let mx = 0;\n  let my = 0;\n  let cx = 0;\n  let cy = 0;\n  for (let i = 0; i < x.length; i++) {\n    const vx = x[i] / sx - cx;\n    const vy = y[i] / sy - cy;\n    const tx = mx + vx;\n    const ty = my + vy;\n    cx = tx - mx - vx;\n    cy = ty - my - vy;\n    mx = tx;\n    my = ty;\n  }\n  mx /= x.length;\n  my /= x.length;\n  let xx = 0;\n  let yy = 0;\n  let xy = 0;\n  for (let i = 0; i < x.length; i++) {\n    const dx = x[i] / sx - mx;\n    const dy = y[i] / sy - my;\n    xx += dx * dx;\n    yy += dy * dy;\n    xy += dx * dy;\n  }\n  if (xx === 0 || yy === 0) {\n    return undefined;\n  }\n  const result = xy / Math.sqrt(xx * yy);\n  // 仅修正浮点舍入越过理论端点的几个 ulp。\n  if (Math.abs(result) > 1 && Math.abs(result) <= 1 + 8 * Number.EPSILON) {\n    return Math.sign(result);\n  }\n  return result;\n}\n\nfunction ranks(values: readonly number[]): number[] {\n  const order = values.map((value, index) => ({ value, index })).sort((a, b) => a.value - b.value);\n  const result = new Array<number>(values.length);\n  for (let start = 0; start < order.length; ) {\n    let end = start + 1;\n    while (end < order.length && order[end].value === order[start].value) {\n      end++;\n    }\n    const rank = (start + end + 1) / 2;\n    for (let i = start; i < end; i++) {\n      result[order[i].index] = rank;\n    }\n    start = end;\n  }\n  return result;\n}\n\nfunction kendall(x: readonly number[], y: readonly number[]): number | undefined {\n  const pairs = x.map((value, index) => ({ x: value, y: y[index] })).sort((a, b) => a.x - b.x || a.y - b.y);\n  const sortedY = [...y].sort((a, b) => a - b);\n  const yRanks = new Map<number, number>();\n  let tiesY = 0;\n  for (let start = 0; start < sortedY.length; ) {\n    let end = start + 1;\n    while (end < sortedY.length && sortedY[end] === sortedY[start]) {\n      end++;\n    }\n    tiesY += ((end - start) * (end - start - 1)) / 2;\n    yRanks.set(sortedY[start], yRanks.size + 1);\n    start = end;\n  }\n  const tree = new Float64Array(yRanks.size + 1);\n  let tiesX = 0;\n  let tiesBoth = 0;\n  let discordant = 0;\n  for (let start = 0; start < pairs.length; ) {\n    let end = start + 1;\n    while (end < pairs.length && pairs[end].x === pairs[start].x) {\n      end++;\n    }\n    tiesX += ((end - start) * (end - start - 1)) / 2;\n    for (let i = start; i < end; ) {\n      let j = i + 1;\n      while (j < end && pairs[j].y === pairs[i].y) {\n        j++;\n      }\n      tiesBoth += ((j - i) * (j - i - 1)) / 2;\n      i = j;\n    }\n    // 同 x 组先查询再更新，避免将 x ties 算成逆序。\n    for (let i = start; i < end; i++) {\n      let lessOrEqual = 0;\n      for (let rank = yRanks.get(pairs[i].y)!; rank > 0; rank -= rank & -rank) {\n        lessOrEqual += tree[rank];\n      }\n      discordant += start - lessOrEqual;\n    }\n    for (let i = start; i < end; i++) {\n      for (let rank = yRanks.get(pairs[i].y)!; rank < tree.length; rank += rank & -rank) {\n        tree[rank]++;\n      }\n    }\n    start = end;\n  }\n  const total = (x.length * (x.length - 1)) / 2;\n  if (total === tiesX || total === tiesY) {\n    return undefined;\n  }\n  return (total - tiesX - tiesY + tiesBoth - 2 * discordant) / Math.sqrt((total - tiesX) * (total - tiesY));\n}\n\n/** 等长有限样本的相关系数；常量/不足两条返回 undefined，不修改数组。 */\nexport function correlation(\n  x: readonly number[],\n  y: readonly number[],\n  method: CorrelationMethod = 'pearson'\n): number | undefined {\n  if (\n    x.length !== y.length ||\n    !['pearson', 'spearman', 'kendall'].includes(method) ||\n    x.some(value => !Number.isFinite(value)) ||\n    y.some(value => !Number.isFinite(value))\n  ) {\n    throw new RangeError('correlation requires equal finite arrays and a supported method');\n  }\n  if (x.length < 2) {\n    return undefined;\n  }\n  return method === 'kendall' ? kendall(x, y) : method === 'spearman' ? pearson(ranks(x), ranks(y)) : pearson(x, y);\n}\n"]}

package/cjs/common/debounce.js

@@ -10,6 +10,9 @@ Object.defineProperty(exports, "__esModule", {
     value: !0
 });
 
+/**
+ * @see https://github.com/lodash/lodash/blob/master/debounce.js
+ */
 const isObject_1 = __importDefault(require("./isObject")), isValidNumber_1 = __importDefault(require("./isValidNumber"));
 
 let hasRaf = !1;
@@ -22,6 +25,7 @@ try {
 
 function debounce(func, wait, options) {
     let lastArgs, lastThis, maxWait, result, timerId, lastCallTime, lastInvokeTime = 0, leading = !1, maxing = !1, trailing = !0;
+    // Bypass `requestAnimationFrame` by explicitly setting `wait=0`.
     const useRAF = !wait && 0 !== wait && hasRaf;
     if ("function" != typeof func) throw new TypeError("Expected a function");
     function invokeFunc(time) {
@@ -34,27 +38,41 @@ function debounce(func, wait, options) {
     }
     function shouldInvoke(time) {
         const timeSinceLastCall = time - lastCallTime;
+        // Either this is the first call, activity has stopped and we're at the
+        // trailing edge, the system time has gone backwards and we're treating
+        // it as the trailing edge, or we've hit the `maxWait` limit.
         return void 0 === lastCallTime || timeSinceLastCall >= wait || timeSinceLastCall < 0 || maxing && time - lastInvokeTime >= maxWait;
     }
     function timerExpired() {
         const time = Date.now();
         if (shouldInvoke(time)) return trailingEdge(time);
-        timerId = startTimer(timerExpired, function(time) {
+        // Restart the timer.
+                timerId = startTimer(timerExpired, function(time) {
             const timeSinceLastInvoke = time - lastInvokeTime, timeWaiting = wait - (time - lastCallTime);
             return maxing ? Math.min(timeWaiting, maxWait - timeSinceLastInvoke) : timeWaiting;
         }(time));
     }
     function trailingEdge(time) {
+        // Only invoke if we have `lastArgs` which means `func` has been
+        // debounced at least once.
         return timerId = void 0, trailing && lastArgs ? invokeFunc(time) : (lastArgs = lastThis = void 0, 
         result);
     }
     function debounced(...args) {
         const time = Date.now(), isInvoking = shouldInvoke(time);
-        if (lastArgs = args, lastThis = this, lastCallTime = time, isInvoking) {
+        if (lastArgs = args, 
+        // @ts-ignore
+        lastThis = this, lastCallTime = time, isInvoking) {
             if (void 0 === timerId) return function(time) {
-                return lastInvokeTime = time, timerId = startTimer(timerExpired, wait), leading ? invokeFunc(time) : result;
+                // Invoke the leading edge.
+                // Reset any `maxWait` timer.
+                return lastInvokeTime = time, 
+                // Start the timer for the trailing edge.
+                timerId = startTimer(timerExpired, wait), leading ? invokeFunc(time) : result;
             }(lastCallTime);
-            if (maxing) return timerId = startTimer(timerExpired, wait), invokeFunc(lastCallTime);
+            if (maxing) 
+            // Handle invocations in a tight loop.
+            return timerId = startTimer(timerExpired, wait), invokeFunc(lastCallTime);
         }
         return void 0 === timerId && (timerId = startTimer(timerExpired, wait)), result;
     }

package/cjs/common/debounce.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/debounce.ts"],"names":[],"mappings":";;;;;AAGA,0DAAkC;AAClC,oEAA4C;AAW5C,IAAI,MAAM,GAAY,KAAK,CAAC;AAC5B,IAAI;IACF,MAAM,GAAG,OAAO,qBAAqB,KAAK,UAAU,IAAI,OAAO,oBAAoB,KAAK,UAAU,CAAC;CACpG;AAAC,OAAO,GAAG,EAAE;IACZ,MAAM,GAAG,KAAK,CAAC;CAChB;AACD,MAAM,GAAG,KAAK,CAAC;AAEf,SAAS,QAAQ,CACf,IAAyB,EACzB,IAAY,EACZ,OAAgC;IAEhC,IAAI,QAAa,CAAC;IAClB,IAAI,QAAa,CAAC;IAClB,IAAI,OAAe,CAAC;IACpB,IAAI,MAAW,CAAC;IAEhB,IAAI,OAA4C,CAAC;IACjD,IAAI,YAAgC,CAAC;IAErC,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,QAAQ,GAAG,IAAI,CAAC;IAGpB,MAAM,MAAM,GAAG,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC;IAE7C,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;QAC9B,MAAM,IAAI,SAAS,CAAC,qBAAqB,CAAC,CAAC;KAC5C;IACD,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC;IAClB,IAAI,IAAA,kBAAQ,EAAC,OAAO,CAAC,EAAE;QACrB,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;QAC5B,MAAM,GAAG,SAAS,IAAI,OAAO,CAAC;QAC9B,IAAI,MAAM,EAAE;YACV,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAA,uBAAa,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;SAChF;QAED,QAAQ,GAAG,UAAU,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;KAClE;IAED,SAAS,UAAU,CAAC,IAAY;QAC9B,MAAM,IAAI,GAAG,QAAQ,CAAC;QACtB,MAAM,OAAO,GAAG,QAAQ,CAAC;QAEzB,QAAQ,GAAG,QAAQ,GAAG,SAAS,CAAC;QAChC,cAAc,GAAG,IAAI,CAAC;QACtB,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS,UAAU,CAAC,WAAgB,EAAE,IAAY;QAChD,IAAI,MAAM,EAAE;YACV,oBAAoB,CAAC,OAAiB,CAAC,CAAC;YACxC,OAAO,qBAAqB,CAAC,WAAW,CAAC,CAAC;SAC3C;QACD,OAAO,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,SAAS,WAAW,CAAC,EAAU;QAC7B,IAAI,MAAM,EAAE;YACV,OAAO,oBAAoB,CAAC,EAAE,CAAC,CAAC;SACjC;QACD,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAED,SAAS,WAAW,CAAC,IAAY;QAE/B,cAAc,GAAG,IAAI,CAAC;QAEtB,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAEzC,OAAO,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC7C,CAAC;IAED,SAAS,aAAa,CAAC,IAAY;QACjC,MAAM,iBAAiB,GAAG,IAAI,GAAI,YAAuB,CAAC;QAC1D,MAAM,mBAAmB,GAAG,IAAI,GAAG,cAAc,CAAC;QAClD,MAAM,WAAW,GAAG,IAAI,GAAG,iBAAiB,CAAC;QAE7C,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,OAAO,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IACrF,CAAC;IAED,SAAS,YAAY,CAAC,IAAY;QAChC,MAAM,iBAAiB,GAAG,IAAI,GAAI,YAAuB,CAAC;QAC1D,MAAM,mBAAmB,GAAG,IAAI,GAAG,cAAc,CAAC;QAKlD,OAAO,CACL,YAAY,KAAK,SAAS;YAC1B,iBAAiB,IAAI,IAAI;YACzB,iBAAiB,GAAG,CAAC;YACrB,CAAC,MAAM,IAAI,mBAAmB,IAAI,OAAO,CAAC,CAC3C,CAAC;IACJ,CAAC;IAED,SAAS,YAAY;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACxB,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE;YACtB,OAAO,YAAY,CAAC,IAAI,CAAC,CAAC;SAC3B;QAED,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,SAAS,YAAY,CAAC,IAAY;QAChC,OAAO,GAAG,SAAS,CAAC;QAIpB,IAAI,QAAQ,IAAI,QAAQ,EAAE;YACxB,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC;SACzB;QACD,QAAQ,GAAG,QAAQ,GAAG,SAAS,CAAC;QAChC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS,MAAM;QACb,IAAI,OAAO,KAAK,SAAS,EAAE;YACzB,WAAW,CAAC,OAAiB,CAAC,CAAC;SAChC;QACD,cAAc,GAAG,CAAC,CAAC;QACnB,QAAQ,GAAG,YAAY,GAAG,QAAQ,GAAG,OAAO,GAAG,SAAS,CAAC;IAC3D,CAAC;IAED,SAAS,KAAK;QACZ,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;IACnE,CAAC;IAED,SAAS,OAAO;QACd,OAAO,OAAO,KAAK,SAAS,CAAC;IAC/B,CAAC;IAED,SAAS,SAAS,CAAC,GAAG,IAAW;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACxB,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QAEtC,QAAQ,GAAG,IAAI,CAAC;QAEhB,QAAQ,GAAG,IAAI,CAAC;QAChB,YAAY,GAAG,IAAI,CAAC;QAEpB,IAAI,UAAU,EAAE;YACd,IAAI,OAAO,KAAK,SAAS,EAAE;gBACzB,OAAO,WAAW,CAAC,YAAY,CAAC,CAAC;aAClC;YACD,IAAI,MAAM,EAAE;gBAEV,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;gBACzC,OAAO,UAAU,CAAC,YAAY,CAAC,CAAC;aACjC;SACF;QACD,IAAI,OAAO,KAAK,SAAS,EAAE;YACzB,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;SAC1C;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,SAAS,CAAC,MAAM,GAAG,MAAM,CAAC;IAC1B,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;IACxB,SAAS,CAAC,OAAO,GAAG,OAAO,CAAC;IAC5B,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,kBAAe,QAAQ,CAAC","file":"debounce.js","sourcesContent":["/**\n * @see https://github.com/lodash/lodash/blob/master/debounce.js\n */\nimport isObject from './isObject';\nimport isValidNumber from './isValidNumber';\n\nexport type FunctionControlOptions = {\n  // 是否在等待开始时调用\n  leading?: boolean;\n  // 是否在等待结束后调用\n  trailing?: boolean;\n  // 最长等待时间\n  maxWait?: number;\n};\n\nlet hasRaf: boolean = false;\ntry {\n  hasRaf = typeof requestAnimationFrame === 'function' && typeof cancelAnimationFrame === 'function';\n} catch (err) {\n  hasRaf = false;\n}\nhasRaf = false;\n\nfunction debounce<T, S>(\n  func: (...args: T[]) => S,\n  wait: number,\n  options?: FunctionControlOptions\n): (...args: T[]) => S {\n  let lastArgs: any;\n  let lastThis: any;\n  let maxWait: number;\n  let result: any;\n  // eslint-disable-next-line no-undef\n  let timerId: number | NodeJS.Timeout | undefined;\n  let lastCallTime: number | undefined;\n\n  let lastInvokeTime = 0;\n  let leading = false;\n  let maxing = false;\n  let trailing = true;\n\n  // Bypass `requestAnimationFrame` by explicitly setting `wait=0`.\n  const useRAF = !wait && wait !== 0 && hasRaf;\n\n  if (typeof func !== 'function') {\n    throw new TypeError('Expected a function');\n  }\n  wait = +wait || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    if (maxing) {\n      maxWait = Math.max(isValidNumber(options.maxWait) ? options.maxWait : 0, wait);\n    }\n\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time: number) {\n    const args = lastArgs;\n    const thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function startTimer(pendingFunc: any, wait: number) {\n    if (useRAF) {\n      cancelAnimationFrame(timerId as number);\n      return requestAnimationFrame(pendingFunc);\n    }\n    return setTimeout(pendingFunc, wait);\n  }\n\n  function cancelTimer(id: number) {\n    if (useRAF) {\n      return cancelAnimationFrame(id);\n    }\n    clearTimeout(id);\n  }\n\n  function leadingEdge(time: number) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = startTimer(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time: number) {\n    const timeSinceLastCall = time - (lastCallTime as number);\n    const timeSinceLastInvoke = time - lastInvokeTime;\n    const timeWaiting = wait - timeSinceLastCall;\n\n    return maxing ? Math.min(timeWaiting, maxWait - timeSinceLastInvoke) : timeWaiting;\n  }\n\n  function shouldInvoke(time: number) {\n    const timeSinceLastCall = time - (lastCallTime as number);\n    const timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (\n      lastCallTime === undefined ||\n      timeSinceLastCall >= wait ||\n      timeSinceLastCall < 0 ||\n      (maxing && timeSinceLastInvoke >= maxWait)\n    );\n  }\n\n  function timerExpired() {\n    const time = Date.now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = startTimer(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time: number) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      cancelTimer(timerId as number);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(Date.now());\n  }\n\n  function pending() {\n    return timerId !== undefined;\n  }\n\n  function debounced(...args: any[]) {\n    const time = Date.now();\n    const isInvoking = shouldInvoke(time);\n\n    lastArgs = args;\n    // @ts-ignore\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        timerId = startTimer(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = startTimer(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  debounced.pending = pending;\n  return debounced;\n}\n\nexport default debounce;\n"]}
+{"version":3,"sources":["../src/common/debounce.ts"],"names":[],"mappings":";;;;;AAAA;;GAEG;AACH,0DAAkC;AAClC,oEAA4C;AAW5C,IAAI,MAAM,GAAY,KAAK,CAAC;AAC5B,IAAI;IACF,MAAM,GAAG,OAAO,qBAAqB,KAAK,UAAU,IAAI,OAAO,oBAAoB,KAAK,UAAU,CAAC;CACpG;AAAC,OAAO,GAAG,EAAE;IACZ,MAAM,GAAG,KAAK,CAAC;CAChB;AACD,MAAM,GAAG,KAAK,CAAC;AAEf,SAAS,QAAQ,CACf,IAAyB,EACzB,IAAY,EACZ,OAAgC;IAEhC,IAAI,QAAa,CAAC;IAClB,IAAI,QAAa,CAAC;IAClB,IAAI,OAAe,CAAC;IACpB,IAAI,MAAW,CAAC;IAChB,oCAAoC;IACpC,IAAI,OAA4C,CAAC;IACjD,IAAI,YAAgC,CAAC;IAErC,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,QAAQ,GAAG,IAAI,CAAC;IAEpB,iEAAiE;IACjE,MAAM,MAAM,GAAG,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC;IAE7C,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;QAC9B,MAAM,IAAI,SAAS,CAAC,qBAAqB,CAAC,CAAC;KAC5C;IACD,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC;IAClB,IAAI,IAAA,kBAAQ,EAAC,OAAO,CAAC,EAAE;QACrB,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;QAC5B,MAAM,GAAG,SAAS,IAAI,OAAO,CAAC;QAC9B,IAAI,MAAM,EAAE;YACV,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAA,uBAAa,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;SAChF;QAED,QAAQ,GAAG,UAAU,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;KAClE;IAED,SAAS,UAAU,CAAC,IAAY;QAC9B,MAAM,IAAI,GAAG,QAAQ,CAAC;QACtB,MAAM,OAAO,GAAG,QAAQ,CAAC;QAEzB,QAAQ,GAAG,QAAQ,GAAG,SAAS,CAAC;QAChC,cAAc,GAAG,IAAI,CAAC;QACtB,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS,UAAU,CAAC,WAAgB,EAAE,IAAY;QAChD,IAAI,MAAM,EAAE;YACV,oBAAoB,CAAC,OAAiB,CAAC,CAAC;YACxC,OAAO,qBAAqB,CAAC,WAAW,CAAC,CAAC;SAC3C;QACD,OAAO,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,SAAS,WAAW,CAAC,EAAU;QAC7B,IAAI,MAAM,EAAE;YACV,OAAO,oBAAoB,CAAC,EAAE,CAAC,CAAC;SACjC;QACD,YAAY,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;IAED,SAAS,WAAW,CAAC,IAAY;QAC/B,6BAA6B;QAC7B,cAAc,GAAG,IAAI,CAAC;QACtB,yCAAyC;QACzC,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACzC,2BAA2B;QAC3B,OAAO,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC7C,CAAC;IAED,SAAS,aAAa,CAAC,IAAY;QACjC,MAAM,iBAAiB,GAAG,IAAI,GAAI,YAAuB,CAAC;QAC1D,MAAM,mBAAmB,GAAG,IAAI,GAAG,cAAc,CAAC;QAClD,MAAM,WAAW,GAAG,IAAI,GAAG,iBAAiB,CAAC;QAE7C,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,OAAO,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IACrF,CAAC;IAED,SAAS,YAAY,CAAC,IAAY;QAChC,MAAM,iBAAiB,GAAG,IAAI,GAAI,YAAuB,CAAC;QAC1D,MAAM,mBAAmB,GAAG,IAAI,GAAG,cAAc,CAAC;QAElD,uEAAuE;QACvE,uEAAuE;QACvE,6DAA6D;QAC7D,OAAO,CACL,YAAY,KAAK,SAAS;YAC1B,iBAAiB,IAAI,IAAI;YACzB,iBAAiB,GAAG,CAAC;YACrB,CAAC,MAAM,IAAI,mBAAmB,IAAI,OAAO,CAAC,CAC3C,CAAC;IACJ,CAAC;IAED,SAAS,YAAY;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACxB,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE;YACtB,OAAO,YAAY,CAAC,IAAI,CAAC,CAAC;SAC3B;QACD,qBAAqB;QACrB,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,SAAS,YAAY,CAAC,IAAY;QAChC,OAAO,GAAG,SAAS,CAAC;QAEpB,gEAAgE;QAChE,2BAA2B;QAC3B,IAAI,QAAQ,IAAI,QAAQ,EAAE;YACxB,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC;SACzB;QACD,QAAQ,GAAG,QAAQ,GAAG,SAAS,CAAC;QAChC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS,MAAM;QACb,IAAI,OAAO,KAAK,SAAS,EAAE;YACzB,WAAW,CAAC,OAAiB,CAAC,CAAC;SAChC;QACD,cAAc,GAAG,CAAC,CAAC;QACnB,QAAQ,GAAG,YAAY,GAAG,QAAQ,GAAG,OAAO,GAAG,SAAS,CAAC;IAC3D,CAAC;IAED,SAAS,KAAK;QACZ,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;IACnE,CAAC;IAED,SAAS,OAAO;QACd,OAAO,OAAO,KAAK,SAAS,CAAC;IAC/B,CAAC;IAED,SAAS,SAAS,CAAC,GAAG,IAAW;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACxB,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QAEtC,QAAQ,GAAG,IAAI,CAAC;QAChB,aAAa;QACb,QAAQ,GAAG,IAAI,CAAC;QAChB,YAAY,GAAG,IAAI,CAAC;QAEpB,IAAI,UAAU,EAAE;YACd,IAAI,OAAO,KAAK,SAAS,EAAE;gBACzB,OAAO,WAAW,CAAC,YAAY,CAAC,CAAC;aAClC;YACD,IAAI,MAAM,EAAE;gBACV,sCAAsC;gBACtC,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;gBACzC,OAAO,UAAU,CAAC,YAAY,CAAC,CAAC;aACjC;SACF;QACD,IAAI,OAAO,KAAK,SAAS,EAAE;YACzB,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;SAC1C;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,SAAS,CAAC,MAAM,GAAG,MAAM,CAAC;IAC1B,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;IACxB,SAAS,CAAC,OAAO,GAAG,OAAO,CAAC;IAC5B,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,kBAAe,QAAQ,CAAC","file":"debounce.js","sourcesContent":["/**\n * @see https://github.com/lodash/lodash/blob/master/debounce.js\n */\nimport isObject from './isObject';\nimport isValidNumber from './isValidNumber';\n\nexport type FunctionControlOptions = {\n  // 是否在等待开始时调用\n  leading?: boolean;\n  // 是否在等待结束后调用\n  trailing?: boolean;\n  // 最长等待时间\n  maxWait?: number;\n};\n\nlet hasRaf: boolean = false;\ntry {\n  hasRaf = typeof requestAnimationFrame === 'function' && typeof cancelAnimationFrame === 'function';\n} catch (err) {\n  hasRaf = false;\n}\nhasRaf = false;\n\nfunction debounce<T, S>(\n  func: (...args: T[]) => S,\n  wait: number,\n  options?: FunctionControlOptions\n): (...args: T[]) => S {\n  let lastArgs: any;\n  let lastThis: any;\n  let maxWait: number;\n  let result: any;\n  // eslint-disable-next-line no-undef\n  let timerId: number | NodeJS.Timeout | undefined;\n  let lastCallTime: number | undefined;\n\n  let lastInvokeTime = 0;\n  let leading = false;\n  let maxing = false;\n  let trailing = true;\n\n  // Bypass `requestAnimationFrame` by explicitly setting `wait=0`.\n  const useRAF = !wait && wait !== 0 && hasRaf;\n\n  if (typeof func !== 'function') {\n    throw new TypeError('Expected a function');\n  }\n  wait = +wait || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    if (maxing) {\n      maxWait = Math.max(isValidNumber(options.maxWait) ? options.maxWait : 0, wait);\n    }\n\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time: number) {\n    const args = lastArgs;\n    const thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function startTimer(pendingFunc: any, wait: number) {\n    if (useRAF) {\n      cancelAnimationFrame(timerId as number);\n      return requestAnimationFrame(pendingFunc);\n    }\n    return setTimeout(pendingFunc, wait);\n  }\n\n  function cancelTimer(id: number) {\n    if (useRAF) {\n      return cancelAnimationFrame(id);\n    }\n    clearTimeout(id);\n  }\n\n  function leadingEdge(time: number) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = startTimer(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time: number) {\n    const timeSinceLastCall = time - (lastCallTime as number);\n    const timeSinceLastInvoke = time - lastInvokeTime;\n    const timeWaiting = wait - timeSinceLastCall;\n\n    return maxing ? Math.min(timeWaiting, maxWait - timeSinceLastInvoke) : timeWaiting;\n  }\n\n  function shouldInvoke(time: number) {\n    const timeSinceLastCall = time - (lastCallTime as number);\n    const timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (\n      lastCallTime === undefined ||\n      timeSinceLastCall >= wait ||\n      timeSinceLastCall < 0 ||\n      (maxing && timeSinceLastInvoke >= maxWait)\n    );\n  }\n\n  function timerExpired() {\n    const time = Date.now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = startTimer(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time: number) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      cancelTimer(timerId as number);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(Date.now());\n  }\n\n  function pending() {\n    return timerId !== undefined;\n  }\n\n  function debounced(...args: any[]) {\n    const time = Date.now();\n    const isInvoking = shouldInvoke(time);\n\n    lastArgs = args;\n    // @ts-ignore\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        timerId = startTimer(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = startTimer(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  debounced.pending = pending;\n  return debounced;\n}\n\nexport default debounce;\n"]}

package/cjs/common/deviation.js

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

package/cjs/common/ecdf.d.ts

@@ -1,3 +1,11 @@
+/**
+ * Empirical Cumulative Distribution Function (ECDF)
+ * Returns a factory that builds an evaluator over provided samples.
+ * The evaluator exposes:
+ * - evaluate(x:number) => proportion of samples <= x
+ * - evaluate(xs:number[]) => number[]
+ * - evaluateGrid(N:number) => { points: number[], cdf: number[] } over sample range
+ */
 export interface ECDFEvaluator {
     evaluate: (x: number | number[]) => number | number[];
     evaluateGrid: (N: number) => {

package/cjs/common/ecdf.js

@@ -1,10 +1,19 @@
 "use strict";
 
-function ecdf(data) {
+/**
+ * Empirical Cumulative Distribution Function (ECDF)
+ * Returns a factory that builds an evaluator over provided samples.
+ * The evaluator exposes:
+ * - evaluate(x:number) => proportion of samples <= x
+ * - evaluate(xs:number[]) => number[]
+ * - evaluateGrid(N:number) => { points: number[], cdf: number[] } over sample range
+ */ function ecdf(data) {
     const n = data.length, sorted = data.slice().sort(((a, b) => a - b));
     function evaluateSingle(x) {
         if (0 === n) return 0;
-        let lo = 0, hi = n;
+        // count of values <= x (upper bound index)
+                let lo = 0, hi = n;
+        // exclusive
         for (;lo < hi; ) {
             const mid = lo + hi >>> 1;
             sorted[mid] <= x ? lo = mid + 1 : hi = mid;

package/cjs/common/ecdf.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/ecdf.ts"],"names":[],"mappings":";;;AAeA,SAAgB,IAAI,CAAC,IAAc;IACjC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAElD,SAAS,cAAc,CAAC,CAAS;QAC/B,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,OAAO,CAAC,CAAC;SACV;QAED,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,OAAO,EAAE,GAAG,EAAE,EAAE;YACd,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBACpB,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;aACd;iBAAM;gBACL,EAAE,GAAG,GAAG,CAAC;aACV;SACF;QACD,OAAO,EAAE,GAAG,CAAC,CAAC;IAChB,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,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAChC;YACD,OAAO,GAAG,CAAC;SACZ;QACD,OAAO,cAAc,CAAC,CAAW,CAAC,CAAC;IACrC,CAAC;IAED,SAAS,YAAY,CAAC,CAAS;QAC7B,MAAM,GAAG,GAA+B,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,EAAE;YACV,OAAO,GAAG,CAAC;SACZ;QACD,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,OAAO,GAAG,CAAC;SACZ;QACD,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,IAAI,GAAG,KAAK,GAAG,EAAE;YACf,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;SACZ;QACD,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;YAE7C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACvC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,QAAe;QACzB,YAAY;QACZ,CAAC;KACF,CAAC;AACJ,CAAC;AA/DD,oBA+DC;AAED,kBAAe,IAAI,CAAC","file":"ecdf.js","sourcesContent":["/**\n * Empirical Cumulative Distribution Function (ECDF)\n * Returns a factory that builds an evaluator over provided samples.\n * The evaluator exposes:\n * - evaluate(x:number) => proportion of samples <= x\n * - evaluate(xs:number[]) => number[]\n * - evaluateGrid(N:number) => { points: number[], cdf: number[] } over sample range\n */\n\nexport interface ECDFEvaluator {\n  evaluate: (x: number | number[]) => number | number[];\n  evaluateGrid: (N: number) => { x: number; y: number }[];\n  n: number;\n}\n\nexport function ecdf(data: number[]): ECDFEvaluator {\n  const n = data.length;\n  const sorted = data.slice().sort((a, b) => a - b);\n\n  function evaluateSingle(x: number) {\n    if (n === 0) {\n      return 0;\n    }\n    // count of values <= x (upper bound index)\n    let lo = 0;\n    let hi = n; // exclusive\n    while (lo < hi) {\n      const mid = (lo + hi) >>> 1;\n      if (sorted[mid] <= x) {\n        lo = mid + 1;\n      } else {\n        hi = mid;\n      }\n    }\n    return lo / n;\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(evaluateSingle(x[i]));\n      }\n      return out;\n    }\n    return evaluateSingle(x as number);\n  }\n\n  function evaluateGrid(N: number) {\n    const out: { x: number; y: number }[] = [];\n    if (N <= 0) {\n      return out;\n    }\n    if (n === 0) {\n      return out;\n    }\n    const min = sorted[0];\n    const max = sorted[n - 1];\n    if (min === max) {\n      for (let i = 0; i < N; i++) {\n        out.push({ x: min, y: 1 });\n      }\n      return out;\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\n      out.push({ x, y: evaluateSingle(x) });\n    }\n    return out;\n  }\n\n  return {\n    evaluate: evaluate as any,\n    evaluateGrid,\n    n\n  };\n}\n\nexport default ecdf;\n"]}
+{"version":3,"sources":["../src/common/ecdf.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;AAQH,SAAgB,IAAI,CAAC,IAAc;IACjC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAElD,SAAS,cAAc,CAAC,CAAS;QAC/B,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,OAAO,CAAC,CAAC;SACV;QACD,2CAA2C;QAC3C,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,YAAY;QACxB,OAAO,EAAE,GAAG,EAAE,EAAE;YACd,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;gBACpB,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;aACd;iBAAM;gBACL,EAAE,GAAG,GAAG,CAAC;aACV;SACF;QACD,OAAO,EAAE,GAAG,CAAC,CAAC;IAChB,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,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAChC;YACD,OAAO,GAAG,CAAC;SACZ;QACD,OAAO,cAAc,CAAC,CAAW,CAAC,CAAC;IACrC,CAAC;IAED,SAAS,YAAY,CAAC,CAAS;QAC7B,MAAM,GAAG,GAA+B,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,EAAE;YACV,OAAO,GAAG,CAAC;SACZ;QACD,IAAI,CAAC,KAAK,CAAC,EAAE;YACX,OAAO,GAAG,CAAC;SACZ;QACD,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,IAAI,GAAG,KAAK,GAAG,EAAE;YACf,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;SACZ;QACD,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC;YAE7C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACvC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,QAAe;QACzB,YAAY;QACZ,CAAC;KACF,CAAC;AACJ,CAAC;AA/DD,oBA+DC;AAED,kBAAe,IAAI,CAAC","file":"ecdf.js","sourcesContent":["/**\n * Empirical Cumulative Distribution Function (ECDF)\n * Returns a factory that builds an evaluator over provided samples.\n * The evaluator exposes:\n * - evaluate(x:number) => proportion of samples <= x\n * - evaluate(xs:number[]) => number[]\n * - evaluateGrid(N:number) => { points: number[], cdf: number[] } over sample range\n */\n\nexport interface ECDFEvaluator {\n  evaluate: (x: number | number[]) => number | number[];\n  evaluateGrid: (N: number) => { x: number; y: number }[];\n  n: number;\n}\n\nexport function ecdf(data: number[]): ECDFEvaluator {\n  const n = data.length;\n  const sorted = data.slice().sort((a, b) => a - b);\n\n  function evaluateSingle(x: number) {\n    if (n === 0) {\n      return 0;\n    }\n    // count of values <= x (upper bound index)\n    let lo = 0;\n    let hi = n; // exclusive\n    while (lo < hi) {\n      const mid = (lo + hi) >>> 1;\n      if (sorted[mid] <= x) {\n        lo = mid + 1;\n      } else {\n        hi = mid;\n      }\n    }\n    return lo / n;\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(evaluateSingle(x[i]));\n      }\n      return out;\n    }\n    return evaluateSingle(x as number);\n  }\n\n  function evaluateGrid(N: number) {\n    const out: { x: number; y: number }[] = [];\n    if (N <= 0) {\n      return out;\n    }\n    if (n === 0) {\n      return out;\n    }\n    const min = sorted[0];\n    const max = sorted[n - 1];\n    if (min === max) {\n      for (let i = 0; i < N; i++) {\n        out.push({ x: min, y: 1 });\n      }\n      return out;\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\n      out.push({ x, y: evaluateSingle(x) });\n    }\n    return out;\n  }\n\n  return {\n    evaluate: evaluate as any,\n    evaluateGrid,\n    n\n  };\n}\n\nexport default ecdf;\n"]}

package/cjs/common/extent.d.ts

@@ -1 +1,5 @@
+/**
+ * Return an array with minimum and maximum values, in the
+ * form [min, max]. Ignores null, undefined, and NaN values.
+ */
 export declare const extent: (array: any[], func?: (val: any) => number) => number[];

package/cjs/common/extent.js

@@ -15,7 +15,8 @@ const isFunction_1 = __importDefault(require("./isFunction")), isNil_1 = __impor
     let min, max;
     if (array && array.length) {
         const n = array.length;
-        for (let i = 0; i < n; i += 1) {
+        // find first valid value
+                for (let i = 0; i < n; i += 1) {
             let value = valueGetter(array[i]);
             (0, isNil_1.default)(value) || !(0, isNumber_1.default)(value = +value) || Number.isNaN(value) || ((0, 
             isNil_1.default)(min) ? (min = value, max = value) : (min = Math.min(min, value), 
@@ -26,4 +27,5 @@ const isFunction_1 = __importDefault(require("./isFunction")), isNil_1 = __impor
     return [ min, max ];
 };
 
-exports.extent = extent;
+exports.extent = extent;
+//# sourceMappingURL=extent.js.map

package/cjs/common/extent.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/extent.ts"],"names":[],"mappings":";;;;;;AAAA,8DAAsC;AACtC,oDAA4B;AAC5B,0DAAkC;AAK3B,MAAM,MAAM,GAAG,CAAC,KAAY,EAAE,IAA2B,EAAE,EAAE;IAClE,MAAM,WAAW,GAAG,IAAA,oBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,GAAG,CAAC;IAChE,IAAI,GAAW,CAAC;IAChB,IAAI,GAAW,CAAC;IAEhB,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE;QACzB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAGvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;YAC7B,IAAI,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,IAAA,eAAK,EAAC,KAAK,CAAC,IAAI,IAAA,kBAAQ,EAAC,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;gBACvE,IAAI,IAAA,eAAK,EAAC,GAAG,CAAC,EAAE;oBACd,GAAG,GAAG,KAAK,CAAC;oBACZ,GAAG,GAAG,KAAK,CAAC;iBACb;qBAAM;oBACL,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;oBAC3B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;iBAC5B;aACF;SACF;QAED,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KACnB;IAED,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AACpB,CAAC,CAAC;AA1BW,QAAA,MAAM,UA0BjB","file":"extent.js","sourcesContent":["import isFunction from './isFunction';\nimport isNil from './isNil';\nimport isNumber from './isNumber';\n/**\n * Return an array with minimum and maximum values, in the\n * form [min, max]. Ignores null, undefined, and NaN values.\n */\nexport const extent = (array: any[], func?: (val: any) => number) => {\n  const valueGetter = isFunction(func) ? func : (val: any) => val;\n  let min: number;\n  let max: number;\n\n  if (array && array.length) {\n    const n = array.length;\n\n    // find first valid value\n    for (let i = 0; i < n; i += 1) {\n      let value = valueGetter(array[i]);\n      if (!isNil(value) && isNumber((value = +value)) && !Number.isNaN(value)) {\n        if (isNil(min)) {\n          min = value;\n          max = value;\n        } else {\n          min = Math.min(min, value);\n          max = Math.max(max, value);\n        }\n      }\n    }\n\n    return [min, max];\n  }\n\n  return [min, max];\n};\n"]}
+{"version":3,"sources":["../src/common/extent.ts"],"names":[],"mappings":";;;;;;AAAA,8DAAsC;AACtC,oDAA4B;AAC5B,0DAAkC;AAClC;;;GAGG;AACI,MAAM,MAAM,GAAG,CAAC,KAAY,EAAE,IAA2B,EAAE,EAAE;IAClE,MAAM,WAAW,GAAG,IAAA,oBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,GAAG,CAAC;IAChE,IAAI,GAAW,CAAC;IAChB,IAAI,GAAW,CAAC;IAEhB,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE;QACzB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAEvB,yBAAyB;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;YAC7B,IAAI,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,IAAA,eAAK,EAAC,KAAK,CAAC,IAAI,IAAA,kBAAQ,EAAC,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;gBACvE,IAAI,IAAA,eAAK,EAAC,GAAG,CAAC,EAAE;oBACd,GAAG,GAAG,KAAK,CAAC;oBACZ,GAAG,GAAG,KAAK,CAAC;iBACb;qBAAM;oBACL,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;oBAC3B,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;iBAC5B;aACF;SACF;QAED,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KACnB;IAED,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AACpB,CAAC,CAAC;AA1BW,QAAA,MAAM,UA0BjB","file":"extent.js","sourcesContent":["import isFunction from './isFunction';\nimport isNil from './isNil';\nimport isNumber from './isNumber';\n/**\n * Return an array with minimum and maximum values, in the\n * form [min, max]. Ignores null, undefined, and NaN values.\n */\nexport const extent = (array: any[], func?: (val: any) => number) => {\n  const valueGetter = isFunction(func) ? func : (val: any) => val;\n  let min: number;\n  let max: number;\n\n  if (array && array.length) {\n    const n = array.length;\n\n    // find first valid value\n    for (let i = 0; i < n; i += 1) {\n      let value = valueGetter(array[i]);\n      if (!isNil(value) && isNumber((value = +value)) && !Number.isNaN(value)) {\n        if (isNil(min)) {\n          min = value;\n          max = value;\n        } else {\n          min = Math.min(min, value);\n          max = Math.max(max, value);\n        }\n      }\n    }\n\n    return [min, max];\n  }\n\n  return [min, max];\n};\n"]}

package/cjs/common/field.d.ts

@@ -1,12 +1,18 @@
+/** 获取字段值的函数 */
 export type FieldGetterFunction = (val: any) => any;
+/** 根据字段路径，返回获取相应路径属性的函数 */
 export type Getter = (path: string[]) => FieldGetterFunction;
 export type FieldOption = {
     field: string;
 };
 export type TagItemAttribute<T> = T | ((d?: any) => T);
+/** field函数对应的参数 */
 export interface FieldGetterGeneratorOptions {
     get?: Getter;
 }
 export declare const getter: (path: string[]) => any;
 export declare const field: (fieldStr: string | string[] | FieldGetterFunction | FieldGetterFunction[], opt?: FieldGetterGeneratorOptions) => any;
+/**
+ * 取数逻辑
+ */
 export declare const simpleField: <T>(option: FieldOption | TagItemAttribute<T>) => (datum: any) => any;

package/cjs/common/field.js

@@ -29,6 +29,9 @@ const fieldSingle = (fieldStr, opt = {}) => {
 
 exports.field = field;
 
+/**
+ * 取数逻辑
+ */
 const simpleField = option => option ? "string" == typeof option || "number" == typeof option ? () => option : (0, 
 isFunction_1.default)(option) ? option : datum => datum[option.field] : null;
 

package/cjs/common/field.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/field.ts"],"names":[],"mappings":";;;;;;AAAA,gDAAwB;AACxB,wDAAgC;AAChC,8DAAsC;AAgB/B,MAAM,MAAM,GAAG,CAAC,IAAc,EAAO,EAAE;IAC5C,OAAO,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAA,aAAG,EAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AACtC,CAAC,CAAC;AAFW,QAAA,MAAM,UAEjB;AAEF,MAAM,WAAW,GAAG,CAAC,QAAsC,EAAE,MAAmC,EAAE,EAAE,EAAE;IACpG,IAAI,IAAA,oBAAU,EAAC,QAAQ,CAAC,EAAE;QACxB,OAAO,QAAQ,CAAC;KACjB;IAED,MAAM,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAExB,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,cAAM,CAAC,CAAC,IAAI,CAAC,CAAC;AAC5C,CAAC,CAAC;AAEK,MAAM,KAAK,GAAG,CACnB,QAAyE,EACzE,MAAmC,EAAE,EACrC,EAAE;IACF,IAAI,IAAA,iBAAO,EAAC,QAAQ,CAAC,EAAE;QACrB,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QAE7D,OAAO,CAAC,KAAU,EAAE,EAAE;YACpB,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC;KACH;IAED,OAAO,WAAW,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC,CAAC;AAbW,QAAA,KAAK,SAahB;AAKK,MAAM,WAAW,GAAG,CAAI,MAAyC,EAAE,EAAE;IAC1E,IAAI,CAAC,MAAM,EAAE;QACX,OAAO,IAAI,CAAC;KACb;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;QAC5D,OAAO,GAAG,EAAE,CAAC,MAAM,CAAC;KACrB;SAAM,IAAI,IAAA,oBAAU,EAAC,MAAM,CAAC,EAAE;QAC7B,OAAO,MAA2B,CAAC;KACpC;IACD,OAAO,CAAC,KAAU,EAAE,EAAE,CAAC,KAAK,CAAE,MAAsB,CAAC,KAAK,CAAC,CAAC;AAC9D,CAAC,CAAC;AAVW,QAAA,WAAW,eAUtB","file":"field.js","sourcesContent":["import get from './get';\nimport isArray from './isArray';\nimport isFunction from './isFunction';\n\n/** 获取字段值的函数 */\nexport type FieldGetterFunction = (val: any) => any;\n\n/** 根据字段路径，返回获取相应路径属性的函数 */\nexport type Getter = (path: string[]) => FieldGetterFunction;\n\nexport type FieldOption = { field: string };\nexport type TagItemAttribute<T> = T | ((d?: any) => T);\n\n/** field函数对应的参数 */\nexport interface FieldGetterGeneratorOptions {\n  get?: Getter;\n}\n\nexport const getter = (path: string[]): any => {\n  return (obj: any) => get(obj, path);\n};\n\nconst fieldSingle = (fieldStr: string | FieldGetterFunction, opt: FieldGetterGeneratorOptions = {}) => {\n  if (isFunction(fieldStr)) {\n    return fieldStr;\n  }\n\n  const path = [fieldStr];\n\n  return ((opt && opt.get) || getter)(path);\n};\n\nexport const field = (\n  fieldStr: string | string[] | FieldGetterFunction | FieldGetterFunction[],\n  opt: FieldGetterGeneratorOptions = {}\n) => {\n  if (isArray(fieldStr)) {\n    const funcs = fieldStr.map(entry => fieldSingle(entry, opt));\n\n    return (datum: any) => {\n      return funcs.map(func => func(datum));\n    };\n  }\n\n  return fieldSingle(fieldStr, opt);\n};\n\n/**\n * 取数逻辑\n */\nexport const simpleField = <T>(option: FieldOption | TagItemAttribute<T>) => {\n  if (!option) {\n    return null;\n  }\n  if (typeof option === 'string' || typeof option === 'number') {\n    return () => option;\n  } else if (isFunction(option)) {\n    return option as (datum: any) => T;\n  }\n  return (datum: any) => datum[(option as FieldOption).field];\n};\n"]}
+{"version":3,"sources":["../src/common/field.ts"],"names":[],"mappings":";;;;;;AAAA,gDAAwB;AACxB,wDAAgC;AAChC,8DAAsC;AAgB/B,MAAM,MAAM,GAAG,CAAC,IAAc,EAAO,EAAE;IAC5C,OAAO,CAAC,GAAQ,EAAE,EAAE,CAAC,IAAA,aAAG,EAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AACtC,CAAC,CAAC;AAFW,QAAA,MAAM,UAEjB;AAEF,MAAM,WAAW,GAAG,CAAC,QAAsC,EAAE,MAAmC,EAAE,EAAE,EAAE;IACpG,IAAI,IAAA,oBAAU,EAAC,QAAQ,CAAC,EAAE;QACxB,OAAO,QAAQ,CAAC;KACjB;IAED,MAAM,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAExB,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,cAAM,CAAC,CAAC,IAAI,CAAC,CAAC;AAC5C,CAAC,CAAC;AAEK,MAAM,KAAK,GAAG,CACnB,QAAyE,EACzE,MAAmC,EAAE,EACrC,EAAE;IACF,IAAI,IAAA,iBAAO,EAAC,QAAQ,CAAC,EAAE;QACrB,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QAE7D,OAAO,CAAC,KAAU,EAAE,EAAE;YACpB,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC;KACH;IAED,OAAO,WAAW,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;AACpC,CAAC,CAAC;AAbW,QAAA,KAAK,SAahB;AAEF;;GAEG;AACI,MAAM,WAAW,GAAG,CAAI,MAAyC,EAAE,EAAE;IAC1E,IAAI,CAAC,MAAM,EAAE;QACX,OAAO,IAAI,CAAC;KACb;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;QAC5D,OAAO,GAAG,EAAE,CAAC,MAAM,CAAC;KACrB;SAAM,IAAI,IAAA,oBAAU,EAAC,MAAM,CAAC,EAAE;QAC7B,OAAO,MAA2B,CAAC;KACpC;IACD,OAAO,CAAC,KAAU,EAAE,EAAE,CAAC,KAAK,CAAE,MAAsB,CAAC,KAAK,CAAC,CAAC;AAC9D,CAAC,CAAC;AAVW,QAAA,WAAW,eAUtB","file":"field.js","sourcesContent":["import get from './get';\nimport isArray from './isArray';\nimport isFunction from './isFunction';\n\n/** 获取字段值的函数 */\nexport type FieldGetterFunction = (val: any) => any;\n\n/** 根据字段路径，返回获取相应路径属性的函数 */\nexport type Getter = (path: string[]) => FieldGetterFunction;\n\nexport type FieldOption = { field: string };\nexport type TagItemAttribute<T> = T | ((d?: any) => T);\n\n/** field函数对应的参数 */\nexport interface FieldGetterGeneratorOptions {\n  get?: Getter;\n}\n\nexport const getter = (path: string[]): any => {\n  return (obj: any) => get(obj, path);\n};\n\nconst fieldSingle = (fieldStr: string | FieldGetterFunction, opt: FieldGetterGeneratorOptions = {}) => {\n  if (isFunction(fieldStr)) {\n    return fieldStr;\n  }\n\n  const path = [fieldStr];\n\n  return ((opt && opt.get) || getter)(path);\n};\n\nexport const field = (\n  fieldStr: string | string[] | FieldGetterFunction | FieldGetterFunction[],\n  opt: FieldGetterGeneratorOptions = {}\n) => {\n  if (isArray(fieldStr)) {\n    const funcs = fieldStr.map(entry => fieldSingle(entry, opt));\n\n    return (datum: any) => {\n      return funcs.map(func => func(datum));\n    };\n  }\n\n  return fieldSingle(fieldStr, opt);\n};\n\n/**\n * 取数逻辑\n */\nexport const simpleField = <T>(option: FieldOption | TagItemAttribute<T>) => {\n  if (!option) {\n    return null;\n  }\n  if (typeof option === 'string' || typeof option === 'number') {\n    return () => option;\n  } else if (isFunction(option)) {\n    return option as (datum: any) => T;\n  }\n  return (datum: any) => datum[(option as FieldOption).field];\n};\n"]}

package/cjs/common/has.d.ts

@@ -1,3 +1,20 @@
 import type { Dict } from './../type';
+/**
+ * Checks if `key` is a direct property of `object`.
+ *
+ * @param {Object} object The object to query.
+ * @param {string} key The key to check.
+ * @returns {boolean} Returns `true` if `key` exists, else `false`.
+ * @example
+ *
+ * const object = { 'a': { 'b': 2 } }
+ * const other = create({ 'a': create({ 'b': 2 }) })
+ *
+ * has(object, 'a')
+ * // => true
+ *
+ * has(other, 'a')
+ * // => false
+ */
 declare const has: (object: Dict<any>, key: any) => boolean;
 export default has;

package/cjs/common/has.js

@@ -4,7 +4,24 @@ Object.defineProperty(exports, "__esModule", {
     value: !0
 });
 
+/** Used to check objects for own properties. */
 const hasOwnProperty = Object.prototype.hasOwnProperty, has = (object, key) => null != object && hasOwnProperty.call(object, key);
 
-exports.default = has;
+/**
+ * Checks if `key` is a direct property of `object`.
+ *
+ * @param {Object} object The object to query.
+ * @param {string} key The key to check.
+ * @returns {boolean} Returns `true` if `key` exists, else `false`.
+ * @example
+ *
+ * const object = { 'a': { 'b': 2 } }
+ * const other = create({ 'a': create({ 'b': 2 }) })
+ *
+ * has(object, 'a')
+ * // => true
+ *
+ * has(other, 'a')
+ * // => false
+ */ exports.default = has;
 //# sourceMappingURL=has.js.map

package/cjs/common/has.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/has.ts"],"names":[],"mappings":";;AAGA,MAAM,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC;AAmBvD,MAAM,GAAG,GAAG,CAAC,MAAiB,EAAE,GAAQ,EAAW,EAAE;IACnD,OAAO,MAAM,IAAI,IAAI,IAAI,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC5D,CAAC,CAAC;AAEF,kBAAe,GAAG,CAAC","file":"has.js","sourcesContent":["import type { Dict } from './../type';\n\n/** Used to check objects for own properties. */\nconst hasOwnProperty = Object.prototype.hasOwnProperty;\n\n/**\n * Checks if `key` is a direct property of `object`.\n *\n * @param {Object} object The object to query.\n * @param {string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n * @example\n *\n * const object = { 'a': { 'b': 2 } }\n * const other = create({ 'a': create({ 'b': 2 }) })\n *\n * has(object, 'a')\n * // => true\n *\n * has(other, 'a')\n * // => false\n */\nconst has = (object: Dict<any>, key: any): boolean => {\n  return object != null && hasOwnProperty.call(object, key);\n};\n\nexport default has;\n"]}
+{"version":3,"sources":["../src/common/has.ts"],"names":[],"mappings":";;AAEA,gDAAgD;AAChD,MAAM,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC;AAEvD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,GAAG,GAAG,CAAC,MAAiB,EAAE,GAAQ,EAAW,EAAE;IACnD,OAAO,MAAM,IAAI,IAAI,IAAI,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC5D,CAAC,CAAC;AAEF,kBAAe,GAAG,CAAC","file":"has.js","sourcesContent":["import type { Dict } from './../type';\n\n/** Used to check objects for own properties. */\nconst hasOwnProperty = Object.prototype.hasOwnProperty;\n\n/**\n * Checks if `key` is a direct property of `object`.\n *\n * @param {Object} object The object to query.\n * @param {string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n * @example\n *\n * const object = { 'a': { 'b': 2 } }\n * const other = create({ 'a': create({ 'b': 2 }) })\n *\n * has(object, 'a')\n * // => true\n *\n * has(other, 'a')\n * // => false\n */\nconst has = (object: Dict<any>, key: any): boolean => {\n  return object != null && hasOwnProperty.call(object, key);\n};\n\nexport default has;\n"]}

package/cjs/common/index.d.ts

@@ -33,6 +33,7 @@ export * from './array';
 export { range } from './range';
 export { ascending } from './ascending';
 export * from './quantileSorted';
+export { normalQuantile } from './normalQuantile';
 export { bisect, findZeroOfFunction, binaryFuzzySearch, binaryFuzzySearchInNumberRange } from './bisect';
 export { deviation } from './deviation';
 export { median } from './median';
@@ -67,3 +68,7 @@ export * from './regression-lowess';
 export * from './regression-polynomial';
 export * from './kde';
 export * from './ecdf';
+export * from './correlation';
+export * from './mean';
+export * from './bootstrap';
+export * from './regression-bootstrap';

package/cjs/common/index.js

@@ -21,9 +21,10 @@ var __createBinding = this && this.__createBinding || (Object.create ? function(
 
 Object.defineProperty(exports, "__esModule", {
     value: !0
-}), exports.debounce = exports.clamper = exports.clampRange = exports.clamp = exports.uuid = exports.truncate = exports.pad = exports.memoize = exports.constant = exports.tickStep = exports.variance = exports.median = exports.deviation = exports.binaryFuzzySearchInNumberRange = exports.binaryFuzzySearch = exports.findZeroOfFunction = exports.bisect = exports.ascending = exports.range = exports.isShallowEqual = exports.isEqual = exports.pickWithout = exports.pick = exports.baseMerge = exports.merge = exports.cloneDeep = exports.clone = exports.has = exports.get = exports.isEmpty = exports.isBase64 = exports.isRegExp = exports.isValidUrl = exports.isValidNumber = exports.isNumeric = exports.isNumber = exports.isDate = exports.isArrayLike = exports.isArray = exports.isString = exports.isUndefined = exports.isType = exports.isPlainObject = exports.isObjectLike = exports.isObject = exports.isValid = exports.isNull = exports.isNil = exports.isFunction = exports.isBoolean = void 0, 
-exports.substitute = exports.upperFirst = exports.lowerFirst = exports.toValidNumber = exports.toNumber = exports.toDate = exports.throttle = void 0;
+}), exports.clamper = exports.clampRange = exports.clamp = exports.uuid = exports.truncate = exports.pad = exports.memoize = exports.constant = exports.tickStep = exports.variance = exports.median = exports.deviation = exports.binaryFuzzySearchInNumberRange = exports.binaryFuzzySearch = exports.findZeroOfFunction = exports.bisect = exports.normalQuantile = exports.ascending = exports.range = exports.isShallowEqual = exports.isEqual = exports.pickWithout = exports.pick = exports.baseMerge = exports.merge = exports.cloneDeep = exports.clone = exports.has = exports.get = exports.isEmpty = exports.isBase64 = exports.isRegExp = exports.isValidUrl = exports.isValidNumber = exports.isNumeric = exports.isNumber = exports.isDate = exports.isArrayLike = exports.isArray = exports.isString = exports.isUndefined = exports.isType = exports.isPlainObject = exports.isObjectLike = exports.isObject = exports.isValid = exports.isNull = exports.isNil = exports.isFunction = exports.isBoolean = void 0, 
+exports.substitute = exports.upperFirst = exports.lowerFirst = exports.toValidNumber = exports.toNumber = exports.toDate = exports.throttle = exports.debounce = void 0;
 
+// type check
 var isBoolean_1 = require("./isBoolean");
 
 Object.defineProperty(exports, "isBoolean", {
@@ -213,6 +214,7 @@ Object.defineProperty(exports, "isEmpty", {
     }
 });
 
+// object
 var get_1 = require("./get");
 
 Object.defineProperty(exports, "get", {
@@ -297,7 +299,9 @@ Object.defineProperty(exports, "isShallowEqual", {
     get: function() {
         return isShallowEqual_1.isShallowEqual;
     }
-}), __exportStar(require("./mixin"), exports), __exportStar(require("./array"), exports);
+}), __exportStar(require("./mixin"), exports), 
+// array
+__exportStar(require("./array"), exports);
 
 var range_1 = require("./range");
 
@@ -317,6 +321,15 @@ Object.defineProperty(exports, "ascending", {
     }
 }), __exportStar(require("./quantileSorted"), exports);
 
+var normalQuantile_1 = require("./normalQuantile");
+
+Object.defineProperty(exports, "normalQuantile", {
+    enumerable: !0,
+    get: function() {
+        return normalQuantile_1.normalQuantile;
+    }
+});
+
 var bisect_1 = require("./bisect");
 
 Object.defineProperty(exports, "bisect", {
@@ -368,6 +381,7 @@ Object.defineProperty(exports, "variance", {
     }
 });
 
+// tick
 var tickStep_1 = require("./tickStep");
 
 Object.defineProperty(exports, "tickStep", {
@@ -375,8 +389,11 @@ Object.defineProperty(exports, "tickStep", {
     get: function() {
         return tickStep_1.tickStep;
     }
-}), __exportStar(require("./number"), exports);
+}), 
+// number
+__exportStar(require("./number"), exports);
 
+// function
 var constant_1 = require("./constant");
 
 Object.defineProperty(exports, "constant", {
@@ -395,6 +412,7 @@ Object.defineProperty(exports, "memoize", {
     }
 });
 
+// pad
 var pad_1 = require("./pad");
 
 Object.defineProperty(exports, "pad", {
@@ -413,6 +431,7 @@ Object.defineProperty(exports, "truncate", {
     }
 });
 
+// uuid
 var uuid_1 = require("./uuid");
 
 Object.defineProperty(exports, "uuid", {
@@ -422,6 +441,7 @@ Object.defineProperty(exports, "uuid", {
     }
 });
 
+// clamp
 var clamp_1 = require("./clamp");
 
 Object.defineProperty(exports, "clamp", {
@@ -449,6 +469,7 @@ Object.defineProperty(exports, "clamper", {
     }
 });
 
+// debounce & throttle
 var debounce_1 = require("./debounce");
 
 Object.defineProperty(exports, "debounce", {
@@ -465,8 +486,11 @@ Object.defineProperty(exports, "throttle", {
     get: function() {
         return __importDefault(throttle_1).default;
     }
-}), __exportStar(require("./interpolate"), exports);
+}), 
+// interpolate
+__exportStar(require("./interpolate"), exports);
 
+// type convert
 var toDate_1 = require("./toDate");
 
 Object.defineProperty(exports, "toDate", {
@@ -494,6 +518,7 @@ Object.defineProperty(exports, "toValidNumber", {
     }
 });
 
+// string
 var lowerFirst_1 = require("./lowerFirst");
 
 Object.defineProperty(exports, "lowerFirst", {
@@ -512,6 +537,7 @@ Object.defineProperty(exports, "upperFirst", {
     }
 });
 
+// string format
 var substitute_1 = require("./substitute");
 
 Object.defineProperty(exports, "substitute", {
@@ -524,5 +550,7 @@ __exportStar(require("./toPercent"), exports), __exportStar(require("./zero"), e
 __exportStar(require("./extent"), exports), __exportStar(require("./regression-linear"), exports), 
 __exportStar(require("./regression-logistic"), exports), __exportStar(require("./regression-lowess"), exports), 
 __exportStar(require("./regression-polynomial"), exports), __exportStar(require("./kde"), exports), 
-__exportStar(require("./ecdf"), exports);
+__exportStar(require("./ecdf"), exports), __exportStar(require("./correlation"), exports), 
+__exportStar(require("./mean"), exports), __exportStar(require("./bootstrap"), exports), 
+__exportStar(require("./regression-bootstrap"), exports);
 //# sourceMappingURL=index.js.map