@visactor/vutils 1.0.24 → 1.0.26

package/es/color/rgbToHsl.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/color/rgbToHsl.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,OAAO,UAAU,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IAC9D,CAAC,IAAI,GAAG,CAAC;IACT,CAAC,IAAI,GAAG,CAAC;IACT,CAAC,IAAI,GAAG,CAAC;IAGT,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,IAAI,KAAK,KAAK,CAAC,EAAE;QACf,CAAC,GAAG,CAAC,CAAC;KACP;SAEI,IAAI,IAAI,KAAK,CAAC,EAAE;QACnB,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;KAC3B;SAEI,IAAI,IAAI,KAAK,CAAC,EAAE;QACnB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;KACzB;SAEI;QACH,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;KACzB;IAED,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,CAAC,GAAG,CAAC,EAAE;QACT,CAAC,IAAI,GAAG,CAAC;KACV;IACD,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAGtB,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAGxD,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1B,OAAO;QACL,CAAC;QACD,CAAC;QACD,CAAC;KACF,CAAC;AACJ,CAAC","file":"rgbToHsl.js","sourcesContent":["export default function rgbToHsl(r: number, g: number, b: number) {\n  r /= 255;\n  g /= 255;\n  b /= 255;\n\n  // Find greatest and smallest channel values\n  const cMin = Math.min(r, g, b);\n  const cMax = Math.max(r, g, b);\n  const delta = cMax - cMin;\n  let h = 0;\n  let s = 0;\n  let l = 0;\n\n  if (delta === 0) {\n    h = 0;\n  }\n  // Red is max\n  else if (cMax === r) {\n    h = ((g - b) / delta) % 6;\n  }\n  // Green is max\n  else if (cMax === g) {\n    h = (b - r) / delta + 2;\n  }\n  // Blue is max\n  else {\n    h = (r - g) / delta + 4;\n  }\n\n  h = Math.round(h * 60);\n  if (h < 0) {\n    h += 360;\n  }\n  l = (cMax + cMin) / 2;\n\n  // Calculate saturation\n  s = delta === 0 ? 0 : delta / (1 - Math.abs(2 * l - 1));\n\n  // Multiply l and s by 100\n  s = +(s * 100).toFixed(1);\n  l = +(l * 100).toFixed(1);\n  return {\n    h,\n    s,\n    l\n  };\n}\n"]}
+{"version":3,"sources":["../src/color/rgbToHsl.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,OAAO,UAAU,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IAC9D,CAAC,IAAI,GAAG,CAAC;IACT,CAAC,IAAI,GAAG,CAAC;IACT,CAAC,IAAI,GAAG,CAAC;IAET,4CAA4C;IAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,IAAI,KAAK,KAAK,CAAC,EAAE;QACf,CAAC,GAAG,CAAC,CAAC;KACP;IACD,aAAa;SACR,IAAI,IAAI,KAAK,CAAC,EAAE;QACnB,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;KAC3B;IACD,eAAe;SACV,IAAI,IAAI,KAAK,CAAC,EAAE;QACnB,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;KACzB;IACD,cAAc;SACT;QACH,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;KACzB;IAED,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACvB,IAAI,CAAC,GAAG,CAAC,EAAE;QACT,CAAC,IAAI,GAAG,CAAC;KACV;IACD,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAEtB,uBAAuB;IACvB,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAExD,0BAA0B;IAC1B,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1B,OAAO;QACL,CAAC;QACD,CAAC;QACD,CAAC;KACF,CAAC;AACJ,CAAC","file":"rgbToHsl.js","sourcesContent":["export default function rgbToHsl(r: number, g: number, b: number) {\n  r /= 255;\n  g /= 255;\n  b /= 255;\n\n  // Find greatest and smallest channel values\n  const cMin = Math.min(r, g, b);\n  const cMax = Math.max(r, g, b);\n  const delta = cMax - cMin;\n  let h = 0;\n  let s = 0;\n  let l = 0;\n\n  if (delta === 0) {\n    h = 0;\n  }\n  // Red is max\n  else if (cMax === r) {\n    h = ((g - b) / delta) % 6;\n  }\n  // Green is max\n  else if (cMax === g) {\n    h = (b - r) / delta + 2;\n  }\n  // Blue is max\n  else {\n    h = (r - g) / delta + 4;\n  }\n\n  h = Math.round(h * 60);\n  if (h < 0) {\n    h += 360;\n  }\n  l = (cMax + cMin) / 2;\n\n  // Calculate saturation\n  s = delta === 0 ? 0 : delta / (1 - Math.abs(2 * l - 1));\n\n  // Multiply l and s by 100\n  s = +(s * 100).toFixed(1);\n  l = +(l * 100).toFixed(1);\n  return {\n    h,\n    s,\n    l\n  };\n}\n"]}

package/es/common/array.d.ts

@@ -1,9 +1,52 @@
+/**
+ * 将传入数据转换为数组格式
+ * @param arr 入参。
+ * @returns 数组
+ */
 export declare function array<T>(arr?: T | T[]): T[];
+/**
+ * 获取数组的最后一个值，如果传入的参数为非数组，则返回 undefined
+ * @param val any
+ * @returns
+ */
 export declare function last<T>(val: T | T[]): T | undefined;
+/**
+ * 获取数组第一项与最后一项的差值，如果数组为空则返回 0
+ * @param arr
+ * @returns
+ */
 export declare const span: (arr: number[]) => number;
+/**
+ * 获取数组中的最大值
+ * @param arr 数组
+ * @param compareFn 比较函数，返回正数表示 a > b，返回负数表示 a < b，返回 0 表示相等
+ * @returns
+ */
 export declare const maxInArray: <T>(arr: T[], compareFn?: (a: T, b: T) => number) => T;
+/**
+ * 获取数组中的最小值
+ * @param arr 数组
+ * @param compareFn 比较函数，返回正数表示 a > b，返回负数表示 a < b，返回 0 表示相等
+ * @returns
+ */
 export declare const minInArray: <T>(arr: T[], compareFn?: (a: T, b: T) => number) => T;
+/**
+ * 判断两个数组是否相同
+ * @param a
+ * @param b
+ * @returns
+ */
 export declare function arrayEqual(a: any, b: any): boolean;
+/**
+ * 封装并返回无重复的数组
+ * @param arr
+ * @returns
+ */
 export declare function uniqArray<T>(arr: T | T[]): T | T[];
 export declare function shuffleArray<T>(arr: T[], random?: () => number): T[];
+/**
+ * 展开多层数组，非数组内容将变为 [input]
+ * @param arr
+ * @returns
+ */
 export declare function flattenArray(arr: any): any[];

package/es/common/array.js

@@ -4,19 +4,36 @@ import isArrayLike from "./isArrayLike";
 
 import isValid from "./isValid";
 
-export function array(arr) {
+/**
+ * 将传入数据转换为数组格式
+ * @param arr 入参。
+ * @returns 数组
+ */ export function array(arr) {
     return isValid(arr) ? isArray(arr) ? arr : [ arr ] : [];
 }
 
-export function last(val) {
+/**
+ * 获取数组的最后一个值，如果传入的参数为非数组，则返回 undefined
+ * @param val any
+ * @returns
+ */ export function last(val) {
     if (isArrayLike(val)) {
         return val[val.length - 1];
     }
 }
 
-export const span = arr => arr.length <= 1 ? 0 : last(arr) - arr[0];
+/**
+ * 获取数组第一项与最后一项的差值，如果数组为空则返回 0
+ * @param arr
+ * @returns
+ */ export const span = arr => arr.length <= 1 ? 0 : last(arr) - arr[0];
 
-export const maxInArray = (arr, compareFn) => {
+/**
+ * 获取数组中的最大值
+ * @param arr 数组
+ * @param compareFn 比较函数，返回正数表示 a > b，返回负数表示 a < b，返回 0 表示相等
+ * @returns
+ */ export const maxInArray = (arr, compareFn) => {
     var _a;
     if (0 === arr.length) return;
     let max = arr[0];
@@ -27,7 +44,12 @@ export const maxInArray = (arr, compareFn) => {
     return max;
 };
 
-export const minInArray = (arr, compareFn) => {
+/**
+ * 获取数组中的最小值
+ * @param arr 数组
+ * @param compareFn 比较函数，返回正数表示 a > b，返回负数表示 a < b，返回 0 表示相等
+ * @returns
+ */ export const minInArray = (arr, compareFn) => {
     var _a;
     if (0 === arr.length) return;
     let min = arr[0];
@@ -38,24 +60,38 @@ export const minInArray = (arr, compareFn) => {
     return min;
 };
 
-export function arrayEqual(a, b) {
+/**
+ * 判断两个数组是否相同
+ * @param a
+ * @param b
+ * @returns
+ */ export function arrayEqual(a, b) {
     if (!isArray(a) || !isArray(b)) return !1;
     if (a.length !== b.length) return !1;
     for (let i = 0; i < a.length; i++) if (a[i] !== b[i]) return !1;
     return !0;
 }
 
-export function uniqArray(arr) {
+/**
+ * 封装并返回无重复的数组
+ * @param arr
+ * @returns
+ */ export function uniqArray(arr) {
     return arr && isArray(arr) ? Array.from(new Set(array(arr))) : arr;
 }
 
+// Based on http://jsfromhell.com/array/shuffle
 export function shuffleArray(arr, random = Math.random) {
     let j, x, i = arr.length;
     for (;i; ) j = Math.floor(random() * i), x = arr[--i], arr[i] = arr[j], arr[j] = x;
     return arr;
 }
 
-export function flattenArray(arr) {
+/**
+ * 展开多层数组，非数组内容将变为 [input]
+ * @param arr
+ * @returns
+ */ export function flattenArray(arr) {
     if (!isArray(arr)) return [ arr ];
     const result = [];
     for (const value of arr) result.push(...flattenArray(value));

package/es/common/array.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/array.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,WAAW,MAAM,eAAe,CAAC;AACxC,OAAO,OAAO,MAAM,WAAW,CAAC;AAOhC,MAAM,UAAU,KAAK,CAAI,GAAa;IACpC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE;QAChB,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KACnC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAOD,MAAM,UAAU,IAAI,CAAI,GAAY;IAClC,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE;QACpB,MAAM,GAAG,GAAG,GAAqB,CAAC;QAClC,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;KAC5B;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAOD,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,GAAa,EAAE,EAAE;IACpC,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE;QACnB,OAAO,CAAC,CAAC;KACV;IACD,OAAQ,IAAI,CAAC,GAAG,CAAY,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC,CAAC;AAQF,MAAM,CAAC,MAAM,UAAU,GAAG,CAAI,GAAQ,EAAE,SAAkC,EAAiB,EAAE;;IAC3F,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;QACpB,OAAO,SAAS,CAAC;KAClB;IACD,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACnC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,MAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,KAAK,EAAE,GAAG,CAAC,mCAAK,KAAgB,GAAI,GAAc,CAAC,GAAG,CAAC,EAAE;YACxE,GAAG,GAAG,KAAK,CAAC;SACb;KACF;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAQF,MAAM,CAAC,MAAM,UAAU,GAAG,CAAI,GAAQ,EAAE,SAAkC,EAAiB,EAAE;;IAC3F,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;QACpB,OAAO,SAAS,CAAC;KAClB;IACD,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACnC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,MAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,KAAK,EAAE,GAAG,CAAC,mCAAK,KAAgB,GAAI,GAAc,CAAC,GAAG,CAAC,EAAE;YACxE,GAAG,GAAG,KAAK,CAAC;SACb;KACF;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAQF,MAAM,UAAU,UAAU,CAAC,CAAM,EAAE,CAAM;IACvC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QAC9B,OAAO,KAAK,CAAC;KACd;IACD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE;QACzB,OAAO,KAAK,CAAC;KACd;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACjC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YACjB,OAAO,KAAK,CAAC;SACd;KACF;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAOD,MAAM,UAAU,SAAS,CAAI,GAAY;IACvC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QACzB,OAAO,GAAG,CAAC;KACZ;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAGD,MAAM,UAAU,YAAY,CAAI,GAAQ,EAAE,SAAuB,IAAI,CAAC,MAAM;IAC1E,IAAI,CAAC,CAAC;IACN,IAAI,CAAC,CAAC;IACN,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IAEnB,OAAO,CAAC,EAAE;QACR,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7B,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACb,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAChB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KACZ;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAOD,MAAM,UAAU,YAAY,CAAC,GAAQ;IACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QACjB,OAAO,CAAC,GAAG,CAAC,CAAC;KACd;IACD,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE;QACvB,MAAM,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;KACrC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","file":"array.js","sourcesContent":["import isArray from './isArray';\nimport isArrayLike from './isArrayLike';\nimport isValid from './isValid';\n\n/**\n * 将传入数据转换为数组格式\n * @param arr 入参。\n * @returns 数组\n */\nexport function array<T>(arr?: T | T[]): T[] {\n  if (isValid(arr)) {\n    return isArray(arr) ? arr : [arr];\n  }\n  return [];\n}\n\n/**\n * 获取数组的最后一个值，如果传入的参数为非数组，则返回 undefined\n * @param val any\n * @returns\n */\nexport function last<T>(val: T | T[]): T | undefined {\n  if (isArrayLike(val)) {\n    const arr = val as ArrayLike<any>;\n    return arr[arr.length - 1];\n  }\n  return undefined;\n}\n\n/**\n * 获取数组第一项与最后一项的差值，如果数组为空\b则返回 0\n * @param arr\n * @returns\n */\nexport const span = (arr: number[]) => {\n  if (arr.length <= 1) {\n    return 0;\n  }\n  return (last(arr) as number) - arr[0];\n};\n\n/**\n * 获取数组中的最大值\n * @param arr 数组\n * @param compareFn 比较函数，返回正数表示 a > b，返回负数表示 a < b，返回 0 表示相等\n * @returns\n */\nexport const maxInArray = <T>(arr: T[], compareFn?: (a: T, b: T) => number): T | undefined => {\n  if (arr.length === 0) {\n    return undefined;\n  }\n  let max = arr[0];\n  for (let i = 1; i < arr.length; i++) {\n    const value = arr[i];\n    if ((compareFn?.(value, max) ?? (value as number) - (max as number)) > 0) {\n      max = value;\n    }\n  }\n  return max;\n};\n\n/**\n * 获取数组中的最小值\n * @param arr 数组\n * @param compareFn 比较函数，返回正数表示 a > b，返回负数表示 a < b，返回 0 表示相等\n * @returns\n */\nexport const minInArray = <T>(arr: T[], compareFn?: (a: T, b: T) => number): T | undefined => {\n  if (arr.length === 0) {\n    return undefined;\n  }\n  let min = arr[0];\n  for (let i = 1; i < arr.length; i++) {\n    const value = arr[i];\n    if ((compareFn?.(value, min) ?? (value as number) - (min as number)) < 0) {\n      min = value;\n    }\n  }\n  return min;\n};\n\n/**\n * 判断两个数组是否相同\n * @param a\n * @param b\n * @returns\n */\nexport function arrayEqual(a: any, b: any): boolean {\n  if (!isArray(a) || !isArray(b)) {\n    return false;\n  }\n  if (a.length !== b.length) {\n    return false;\n  }\n  for (let i = 0; i < a.length; i++) {\n    if (a[i] !== b[i]) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * 封装并返回无重复的数组\n * @param arr\n * @returns\n */\nexport function uniqArray<T>(arr: T | T[]): T | T[] {\n  if (!arr || !isArray(arr)) {\n    return arr;\n  }\n  return Array.from(new Set(array(arr)));\n}\n\n// Based on http://jsfromhell.com/array/shuffle\nexport function shuffleArray<T>(arr: T[], random: () => number = Math.random): T[] {\n  let j;\n  let x;\n  let i = arr.length;\n\n  while (i) {\n    j = Math.floor(random() * i);\n    x = arr[--i];\n    arr[i] = arr[j];\n    arr[j] = x;\n  }\n  return arr;\n}\n\n/**\n * 展开多层数组，非数组内容将变为 [input]\n * @param arr\n * @returns\n */\nexport function flattenArray(arr: any): any[] {\n  if (!isArray(arr)) {\n    return [arr];\n  }\n  const result = [];\n  for (const value of arr) {\n    result.push(...flattenArray(value));\n  }\n  return result;\n}\n"]}
+{"version":3,"sources":["../src/common/array.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,WAAW,MAAM,eAAe,CAAC;AACxC,OAAO,OAAO,MAAM,WAAW,CAAC;AAEhC;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAI,GAAa;IACpC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE;QAChB,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KACnC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,IAAI,CAAI,GAAY;IAClC,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE;QACpB,MAAM,GAAG,GAAG,GAAqB,CAAC;QAClC,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;KAC5B;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,GAAa,EAAE,EAAE;IACpC,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,EAAE;QACnB,OAAO,CAAC,CAAC;KACV;IACD,OAAQ,IAAI,CAAC,GAAG,CAAY,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAI,GAAQ,EAAE,SAAkC,EAAiB,EAAE;;IAC3F,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;QACpB,OAAO,SAAS,CAAC;KAClB;IACD,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACnC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,MAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,KAAK,EAAE,GAAG,CAAC,mCAAK,KAAgB,GAAI,GAAc,CAAC,GAAG,CAAC,EAAE;YACxE,GAAG,GAAG,KAAK,CAAC;SACb;KACF;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAI,GAAQ,EAAE,SAAkC,EAAiB,EAAE;;IAC3F,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;QACpB,OAAO,SAAS,CAAC;KAClB;IACD,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACnC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,MAAA,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,KAAK,EAAE,GAAG,CAAC,mCAAK,KAAgB,GAAI,GAAc,CAAC,GAAG,CAAC,EAAE;YACxE,GAAG,GAAG,KAAK,CAAC;SACb;KACF;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,CAAM,EAAE,CAAM;IACvC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QAC9B,OAAO,KAAK,CAAC;KACd;IACD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE;QACzB,OAAO,KAAK,CAAC;KACd;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACjC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YACjB,OAAO,KAAK,CAAC;SACd;KACF;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAI,GAAY;IACvC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QACzB,OAAO,GAAG,CAAC;KACZ;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,YAAY,CAAI,GAAQ,EAAE,SAAuB,IAAI,CAAC,MAAM;IAC1E,IAAI,CAAC,CAAC;IACN,IAAI,CAAC,CAAC;IACN,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IAEnB,OAAO,CAAC,EAAE;QACR,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7B,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACb,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAChB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;KACZ;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,GAAQ;IACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QACjB,OAAO,CAAC,GAAG,CAAC,CAAC;KACd;IACD,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE;QACvB,MAAM,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;KACrC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","file":"array.js","sourcesContent":["import isArray from './isArray';\nimport isArrayLike from './isArrayLike';\nimport isValid from './isValid';\n\n/**\n * 将传入数据转换为数组格式\n * @param arr 入参。\n * @returns 数组\n */\nexport function array<T>(arr?: T | T[]): T[] {\n  if (isValid(arr)) {\n    return isArray(arr) ? arr : [arr];\n  }\n  return [];\n}\n\n/**\n * 获取数组的最后一个值，如果传入的参数为非数组，则返回 undefined\n * @param val any\n * @returns\n */\nexport function last<T>(val: T | T[]): T | undefined {\n  if (isArrayLike(val)) {\n    const arr = val as ArrayLike<any>;\n    return arr[arr.length - 1];\n  }\n  return undefined;\n}\n\n/**\n * 获取数组第一项与最后一项的差值，如果数组为空\b则返回 0\n * @param arr\n * @returns\n */\nexport const span = (arr: number[]) => {\n  if (arr.length <= 1) {\n    return 0;\n  }\n  return (last(arr) as number) - arr[0];\n};\n\n/**\n * 获取数组中的最大值\n * @param arr 数组\n * @param compareFn 比较函数，返回正数表示 a > b，返回负数表示 a < b，返回 0 表示相等\n * @returns\n */\nexport const maxInArray = <T>(arr: T[], compareFn?: (a: T, b: T) => number): T | undefined => {\n  if (arr.length === 0) {\n    return undefined;\n  }\n  let max = arr[0];\n  for (let i = 1; i < arr.length; i++) {\n    const value = arr[i];\n    if ((compareFn?.(value, max) ?? (value as number) - (max as number)) > 0) {\n      max = value;\n    }\n  }\n  return max;\n};\n\n/**\n * 获取数组中的最小值\n * @param arr 数组\n * @param compareFn 比较函数，返回正数表示 a > b，返回负数表示 a < b，返回 0 表示相等\n * @returns\n */\nexport const minInArray = <T>(arr: T[], compareFn?: (a: T, b: T) => number): T | undefined => {\n  if (arr.length === 0) {\n    return undefined;\n  }\n  let min = arr[0];\n  for (let i = 1; i < arr.length; i++) {\n    const value = arr[i];\n    if ((compareFn?.(value, min) ?? (value as number) - (min as number)) < 0) {\n      min = value;\n    }\n  }\n  return min;\n};\n\n/**\n * 判断两个数组是否相同\n * @param a\n * @param b\n * @returns\n */\nexport function arrayEqual(a: any, b: any): boolean {\n  if (!isArray(a) || !isArray(b)) {\n    return false;\n  }\n  if (a.length !== b.length) {\n    return false;\n  }\n  for (let i = 0; i < a.length; i++) {\n    if (a[i] !== b[i]) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * 封装并返回无重复的数组\n * @param arr\n * @returns\n */\nexport function uniqArray<T>(arr: T | T[]): T | T[] {\n  if (!arr || !isArray(arr)) {\n    return arr;\n  }\n  return Array.from(new Set(array(arr)));\n}\n\n// Based on http://jsfromhell.com/array/shuffle\nexport function shuffleArray<T>(arr: T[], random: () => number = Math.random): T[] {\n  let j;\n  let x;\n  let i = arr.length;\n\n  while (i) {\n    j = Math.floor(random() * i);\n    x = arr[--i];\n    arr[i] = arr[j];\n    arr[j] = x;\n  }\n  return arr;\n}\n\n/**\n * 展开多层数组，非数组内容将变为 [input]\n * @param arr\n * @returns\n */\nexport function flattenArray(arr: any): any[] {\n  if (!isArray(arr)) {\n    return [arr];\n  }\n  const result = [];\n  for (const value of arr) {\n    result.push(...flattenArray(value));\n  }\n  return result;\n}\n"]}

package/es/common/bisect.d.ts

@@ -1,7 +1,28 @@
+/**
+ * 通过二分法，查找数组a中大于数值x的第一个元素的序号
+ * @param a
+ * @param x
+ * @param lo
+ * @param hi
+ * @returns
+ */
 export declare function bisect(a: number[], x: number, lo?: number, hi?: number): number;
+/** finds the zeros of a function, given two starting points (which must
+ * have opposite signs */
 export declare function findZeroOfFunction(f: (entry: number) => number, a: number, b: number, parameters?: {
     maxIterations?: number;
     tolerance?: number;
 }): number;
+/**
+ * 二分靠近框架，返回数组中第一个大于等于目标值的数的索引
+ * @param arr 数组
+ * @param compareFn 比较函数，返回(当前值-目标值)
+ */
 export declare const binaryFuzzySearch: <T>(arr: T[], compareFn: (value: T) => number) => number;
+/**
+ * 二分靠近框架，返回数字区间中第一个大于等于目标值的数字
+ * @param x1 区间上界
+ * @param x2 区间下界（不包含）
+ * @param compareFn 比较函数，返回(当前值-目标值)
+ */
 export declare const binaryFuzzySearchInNumberRange: (x1: number, x2: number, compareFn: (value: number) => number) => number;

package/es/common/bisect.js

@@ -4,7 +4,14 @@ import isNil from "./isNil";
 
 import { Logger } from "../logger";
 
-export function bisect(a, x, lo = 0, hi) {
+/**
+ * 通过二分法，查找数组a中大于数值x的第一个元素的序号
+ * @param a
+ * @param x
+ * @param lo
+ * @param hi
+ * @returns
+ */ export function bisect(a, x, lo = 0, hi) {
     for (isNil(hi) && (hi = a.length); lo < hi; ) {
         const mid = lo + hi >>> 1;
         ascending(a[mid], x) > 0 ? hi = mid : lo = mid + 1;
@@ -12,7 +19,16 @@ export function bisect(a, x, lo = 0, hi) {
     return lo;
 }
 
-export function findZeroOfFunction(f, a, b, parameters) {
+/* Adapted from fmin by Ben Frederickson
+ * https://github.com/benfred/fmin
+ * Licensed under the BSD-3-Clause
+
+ * url: https://github.com/benfred/fmin/blob/master/src/bisect.js
+ * License: https://github.com/benfred/fmin/blob/master/LICENSE
+ * @license
+ */
+/** finds the zeros of a function, given two starting points (which must
+ * have opposite signs */ export function findZeroOfFunction(f, a, b, parameters) {
     var _a, _b;
     const maxIterations = null !== (_a = null == parameters ? void 0 : parameters.maxIterations) && void 0 !== _a ? _a : 100, tolerance = null !== (_b = null == parameters ? void 0 : parameters.tolerance) && void 0 !== _b ? _b : 1e-10, fA = f(a), fB = f(b);
     let delta = b - a;
@@ -30,9 +46,18 @@ export function findZeroOfFunction(f, a, b, parameters) {
     return a + delta;
 }
 
-export const binaryFuzzySearch = (arr, compareFn) => binaryFuzzySearchInNumberRange(0, arr.length, (value => compareFn(arr[value])));
+/**
+ * 二分靠近框架，返回数组中第一个大于等于目标值的数的索引
+ * @param arr 数组
+ * @param compareFn 比较函数，返回(当前值-目标值)
+ */ export const binaryFuzzySearch = (arr, compareFn) => binaryFuzzySearchInNumberRange(0, arr.length, (value => compareFn(arr[value])));
 
-export const binaryFuzzySearchInNumberRange = (x1, x2, compareFn) => {
+/**
+ * 二分靠近框架，返回数字区间中第一个大于等于目标值的数字
+ * @param x1 区间上界
+ * @param x2 区间下界（不包含）
+ * @param compareFn 比较函数，返回(当前值-目标值)
+ */ export const binaryFuzzySearchInNumberRange = (x1, x2, compareFn) => {
     let left = x1, right = x2;
     for (;left < right; ) {
         const mid = Math.floor((left + right) / 2);

package/es/common/bisect.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/bisect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAUnC,MAAM,UAAU,MAAM,CAAC,CAAW,EAAE,CAAS,EAAE,KAAa,CAAC,EAAE,EAAW;IACxE,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE;QACb,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;KACf;IACD,OAAO,EAAE,GAAI,EAAa,EAAE;QAC1B,MAAM,GAAG,GAAW,CAAC,EAAE,GAAI,EAAa,CAAC,KAAK,CAAC,CAAC;QAChD,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE;YAC5B,EAAE,GAAG,GAAG,CAAC;SACV;aAAM;YACL,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;SACd;KACF;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAYD,MAAM,UAAU,kBAAkB,CAChC,CAA4B,EAC5B,CAAS,EACT,CAAS,EACT,UAGC;;IAED,MAAM,aAAa,GAAG,MAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,aAAa,mCAAI,GAAG,CAAC;IACvD,MAAM,SAAS,GAAG,MAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,SAAS,mCAAI,KAAK,CAAC;IACjD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IAElB,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE;QACf,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,CAAC,KAAK,CAAC,gDAAgD,CAAC,CAAC;QAC/D,OAAO,GAAG,CAAC;KACZ;IAED,IAAI,EAAE,KAAK,CAAC,EAAE;QACZ,OAAO,CAAC,CAAC;KACV;IACD,IAAI,EAAE,KAAK,CAAC,EAAE;QACZ,OAAO,CAAC,CAAC;KACV;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,EAAE,CAAC,EAAE;QACtC,KAAK,IAAI,CAAC,CAAC;QACX,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAEpB,IAAI,IAAI,GAAG,EAAE,IAAI,CAAC,EAAE;YAClB,CAAC,GAAG,GAAG,CAAC;SACT;QAED,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,SAAS,IAAI,IAAI,KAAK,CAAC,EAAE;YAC7C,OAAO,GAAG,CAAC;SACZ;KACF;IACD,OAAO,CAAC,GAAG,KAAK,CAAC;AACnB,CAAC;AAOD,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAI,GAAQ,EAAE,SAA+B,EAAE,EAAE;IAChF,OAAO,8BAA8B,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACvF,CAAC,CAAC;AAQF,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,SAAoC,EAAE,EAAE;IAC7G,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,OAAO,IAAI,GAAG,KAAK,EAAE;QACnB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YACvB,KAAK,GAAG,GAAG,CAAC;SACb;aAAM;YACL,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;SAChB;KACF;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC","file":"bisect.js","sourcesContent":["import { ascending } from './ascending';\nimport isNil from './isNil';\nimport { Logger } from '../logger';\n\n/**\n * 通过二分法，查找数组a中大于数值x的第一个元素的序号\n * @param a\n * @param x\n * @param lo\n * @param hi\n * @returns\n */\nexport function bisect(a: number[], x: number, lo: number = 0, hi?: number) {\n  if (isNil(hi)) {\n    hi = a.length;\n  }\n  while (lo < (hi as number)) {\n    const mid: number = (lo + (hi as number)) >>> 1;\n    if (ascending(a[mid], x) > 0) {\n      hi = mid;\n    } else {\n      lo = mid + 1;\n    }\n  }\n  return lo;\n}\n\n/* Adapted from fmin by Ben Frederickson\n * https://github.com/benfred/fmin\n * Licensed under the BSD-3-Clause\n\n * url: https://github.com/benfred/fmin/blob/master/src/bisect.js\n * License: https://github.com/benfred/fmin/blob/master/LICENSE\n * @license\n */\n/** finds the zeros of a function, given two starting points (which must\n * have opposite signs */\nexport function findZeroOfFunction(\n  f: (entry: number) => number,\n  a: number,\n  b: number,\n  parameters?: {\n    maxIterations?: number;\n    tolerance?: number;\n  }\n) {\n  const maxIterations = parameters?.maxIterations ?? 100;\n  const tolerance = parameters?.tolerance ?? 1e-10;\n  const fA = f(a);\n  const fB = f(b);\n  let delta = b - a;\n\n  if (fA * fB > 0) {\n    const logger = Logger.getInstance();\n    logger.error('Initial bisect points must have opposite signs');\n    return NaN;\n  }\n\n  if (fA === 0) {\n    return a;\n  }\n  if (fB === 0) {\n    return b;\n  }\n\n  for (let i = 0; i < maxIterations; ++i) {\n    delta /= 2;\n    const mid = a + delta;\n    const fMid = f(mid);\n\n    if (fMid * fA >= 0) {\n      a = mid;\n    }\n\n    if (Math.abs(delta) < tolerance || fMid === 0) {\n      return mid;\n    }\n  }\n  return a + delta;\n}\n\n/**\n * 二分靠近框架，返回数组中第一个大于等于目标值的数的索引\n * @param arr 数组\n * @param compareFn 比较函数，返回(当前值-目标值)\n */\nexport const binaryFuzzySearch = <T>(arr: T[], compareFn: (value: T) => number) => {\n  return binaryFuzzySearchInNumberRange(0, arr.length, value => compareFn(arr[value]));\n};\n\n/**\n * 二分靠近框架，返回数字区间中第一个大于等于目标值的数字\n * @param x1 区间上界\n * @param x2 区间下界（不包含）\n * @param compareFn 比较函数，返回(当前值-目标值)\n */\nexport const binaryFuzzySearchInNumberRange = (x1: number, x2: number, compareFn: (value: number) => number) => {\n  let left = x1;\n  let right = x2;\n  while (left < right) {\n    const mid = Math.floor((left + right) / 2);\n    if (compareFn(mid) >= 0) {\n      right = mid; // 第一个大于等于目标值的数\n    } else {\n      left = mid + 1;\n    }\n  }\n  return left;\n};\n"]}
+{"version":3,"sources":["../src/common/bisect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAEnC;;;;;;;GAOG;AACH,MAAM,UAAU,MAAM,CAAC,CAAW,EAAE,CAAS,EAAE,KAAa,CAAC,EAAE,EAAW;IACxE,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE;QACb,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC;KACf;IACD,OAAO,EAAE,GAAI,EAAa,EAAE;QAC1B,MAAM,GAAG,GAAW,CAAC,EAAE,GAAI,EAAa,CAAC,KAAK,CAAC,CAAC;QAChD,IAAI,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE;YAC5B,EAAE,GAAG,GAAG,CAAC;SACV;aAAM;YACL,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;SACd;KACF;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;;;;GAOG;AACH;yBACyB;AACzB,MAAM,UAAU,kBAAkB,CAChC,CAA4B,EAC5B,CAAS,EACT,CAAS,EACT,UAGC;;IAED,MAAM,aAAa,GAAG,MAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,aAAa,mCAAI,GAAG,CAAC;IACvD,MAAM,SAAS,GAAG,MAAA,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,SAAS,mCAAI,KAAK,CAAC;IACjD,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IAElB,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE;QACf,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,CAAC,KAAK,CAAC,gDAAgD,CAAC,CAAC;QAC/D,OAAO,GAAG,CAAC;KACZ;IAED,IAAI,EAAE,KAAK,CAAC,EAAE;QACZ,OAAO,CAAC,CAAC;KACV;IACD,IAAI,EAAE,KAAK,CAAC,EAAE;QACZ,OAAO,CAAC,CAAC;KACV;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,EAAE,CAAC,EAAE;QACtC,KAAK,IAAI,CAAC,CAAC;QACX,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;QACtB,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAEpB,IAAI,IAAI,GAAG,EAAE,IAAI,CAAC,EAAE;YAClB,CAAC,GAAG,GAAG,CAAC;SACT;QAED,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,SAAS,IAAI,IAAI,KAAK,CAAC,EAAE;YAC7C,OAAO,GAAG,CAAC;SACZ;KACF;IACD,OAAO,CAAC,GAAG,KAAK,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAI,GAAQ,EAAE,SAA+B,EAAE,EAAE;IAChF,OAAO,8BAA8B,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACvF,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,SAAoC,EAAE,EAAE;IAC7G,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,OAAO,IAAI,GAAG,KAAK,EAAE;QACnB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YACvB,KAAK,GAAG,GAAG,CAAC,CAAC,eAAe;SAC7B;aAAM;YACL,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;SAChB;KACF;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC","file":"bisect.js","sourcesContent":["import { ascending } from './ascending';\nimport isNil from './isNil';\nimport { Logger } from '../logger';\n\n/**\n * 通过二分法，查找数组a中大于数值x的第一个元素的序号\n * @param a\n * @param x\n * @param lo\n * @param hi\n * @returns\n */\nexport function bisect(a: number[], x: number, lo: number = 0, hi?: number) {\n  if (isNil(hi)) {\n    hi = a.length;\n  }\n  while (lo < (hi as number)) {\n    const mid: number = (lo + (hi as number)) >>> 1;\n    if (ascending(a[mid], x) > 0) {\n      hi = mid;\n    } else {\n      lo = mid + 1;\n    }\n  }\n  return lo;\n}\n\n/* Adapted from fmin by Ben Frederickson\n * https://github.com/benfred/fmin\n * Licensed under the BSD-3-Clause\n\n * url: https://github.com/benfred/fmin/blob/master/src/bisect.js\n * License: https://github.com/benfred/fmin/blob/master/LICENSE\n * @license\n */\n/** finds the zeros of a function, given two starting points (which must\n * have opposite signs */\nexport function findZeroOfFunction(\n  f: (entry: number) => number,\n  a: number,\n  b: number,\n  parameters?: {\n    maxIterations?: number;\n    tolerance?: number;\n  }\n) {\n  const maxIterations = parameters?.maxIterations ?? 100;\n  const tolerance = parameters?.tolerance ?? 1e-10;\n  const fA = f(a);\n  const fB = f(b);\n  let delta = b - a;\n\n  if (fA * fB > 0) {\n    const logger = Logger.getInstance();\n    logger.error('Initial bisect points must have opposite signs');\n    return NaN;\n  }\n\n  if (fA === 0) {\n    return a;\n  }\n  if (fB === 0) {\n    return b;\n  }\n\n  for (let i = 0; i < maxIterations; ++i) {\n    delta /= 2;\n    const mid = a + delta;\n    const fMid = f(mid);\n\n    if (fMid * fA >= 0) {\n      a = mid;\n    }\n\n    if (Math.abs(delta) < tolerance || fMid === 0) {\n      return mid;\n    }\n  }\n  return a + delta;\n}\n\n/**\n * 二分靠近框架，返回数组中第一个大于等于目标值的数的索引\n * @param arr 数组\n * @param compareFn 比较函数，返回(当前值-目标值)\n */\nexport const binaryFuzzySearch = <T>(arr: T[], compareFn: (value: T) => number) => {\n  return binaryFuzzySearchInNumberRange(0, arr.length, value => compareFn(arr[value]));\n};\n\n/**\n * 二分靠近框架，返回数字区间中第一个大于等于目标值的数字\n * @param x1 区间上界\n * @param x2 区间下界（不包含）\n * @param compareFn 比较函数，返回(当前值-目标值)\n */\nexport const binaryFuzzySearchInNumberRange = (x1: number, x2: number, compareFn: (value: number) => number) => {\n  let left = x1;\n  let right = x2;\n  while (left < right) {\n    const mid = Math.floor((left + right) / 2);\n    if (compareFn(mid) >= 0) {\n      right = mid; // 第一个大于等于目标值的数\n    } else {\n      left = mid + 1;\n    }\n  }\n  return left;\n};\n"]}

package/es/common/bootstrap.d.ts

@@ -0,0 +1,5 @@
+/** 有放回重采样；回调不得修改或持有复用的只读样本缓冲区。 */
+export declare function bootstrapEstimate(values: readonly number[], estimator: (sample: readonly number[]) => number, options: {
+    resamples: number;
+    seed: number;
+}): number[];

package/es/common/bootstrap.js

@@ -0,0 +1,14 @@
+import { randomLCG } from "./random";
+
+/** 有放回重采样；回调不得修改或持有复用的只读样本缓冲区。 */ export function bootstrapEstimate(values, estimator, options) {
+    if (!values.length || values.some((value => !Number.isFinite(value))) || !Number.isInteger(options.resamples) || options.resamples < 1 || !Number.isInteger(options.seed) || options.seed < 0 || options.seed > 4294967295) throw new RangeError("bootstrap requires finite observations, positive resamples and a uint32 seed");
+    const random = randomLCG(options.seed), sample = new Array(values.length), estimates = new Array(options.resamples);
+    for (let b = 0; b < options.resamples; b++) {
+        for (let i = 0; i < sample.length; i++) sample[i] = values[Math.floor(random() * values.length)];
+        const estimate = estimator(sample);
+        if (!Number.isFinite(estimate)) throw new RangeError("bootstrap estimator must return a finite number");
+        estimates[b] = estimate;
+    }
+    return estimates;
+}
+//# sourceMappingURL=bootstrap.js.map

package/es/common/bootstrap.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/bootstrap.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AACrC,kCAAkC;AAClC,MAAM,UAAU,iBAAiB,CAC/B,MAAyB,EACzB,SAAgD,EAChD,OAA4C;IAE5C,IACE,CAAC,MAAM,CAAC,MAAM;QACd,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC7C,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,8EAA8E,CAAC,CAAC;KACtG;IACD,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,MAAM,CAAC,MAAM,CAAC,CAAC;IAChD,MAAM,SAAS,GAAG,IAAI,KAAK,CAAS,OAAO,CAAC,SAAS,CAAC,CAAC;IACvD,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,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE;YAC9B,MAAM,IAAI,UAAU,CAAC,iDAAiD,CAAC,CAAC;SACzE;QACD,SAAS,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;KACzB;IACD,OAAO,SAAS,CAAC;AACnB,CAAC","file":"bootstrap.js","sourcesContent":["import { randomLCG } from './random';\n/** 有放回重采样；回调不得修改或持有复用的只读样本缓冲区。 */\nexport function bootstrapEstimate(\n  values: readonly number[],\n  estimator: (sample: readonly number[]) => number,\n  options: { resamples: number; seed: number }\n): number[] {\n  if (\n    !values.length ||\n    values.some(value => !Number.isFinite(value)) ||\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('bootstrap requires finite observations, positive resamples and a uint32 seed');\n  }\n  const random = randomLCG(options.seed);\n  const sample = new Array<number>(values.length);\n  const estimates = 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] = values[Math.floor(random() * values.length)];\n    }\n    const estimate = estimator(sample);\n    if (!Number.isFinite(estimate)) {\n      throw new RangeError('bootstrap estimator must return a finite number');\n    }\n    estimates[b] = estimate;\n  }\n  return estimates;\n}\n"]}

package/es/common/clone.js

@@ -10,10 +10,16 @@ function getRegExpFlags(re) {
     flags;
 }
 
+// Adapted from https://github.com/pvorb/clone by Paul Vorbach
+// License: https://github.com/pvorb/clone/blob/master/LICENSE
 export default function clone(parent, circular = !1, depth = 0, prototype = void 0) {
+    // maintain two arrays for circular references, where corresponding parents
+    // and children have the same index
     const allParents = [], allChildren = [];
     return void 0 === circular && (circular = !0), void 0 === depth && (depth = 1 / 0), 
+    // recurse this function so we don't reset allParents and allChildren
     function _clone(parent, depth) {
+        // cloning null always returns null
         if (null === parent) return null;
         if (0 === depth) return parent;
         let child;

package/es/common/clone.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/clone.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,MAAM,MAAM,UAAU,CAAC;AAC9B,OAAO,QAAQ,MAAM,YAAY,CAAC;AAElC,SAAS,cAAc,CAAC,EAAO;IAC7B,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,EAAE,CAAC,MAAM,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC;IAC5B,EAAE,CAAC,UAAU,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC;IAChC,EAAE,CAAC,SAAS,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC;AAID,MAAM,CAAC,OAAO,UAAU,KAAK,CAAC,MAAW,EAAE,QAAQ,GAAG,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,YAAiB,SAAS;IAGhG,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,MAAM,WAAW,GAAe,EAAE,CAAC;IAEnC,IAAI,OAAO,QAAQ,KAAK,WAAW,EAAE;QACnC,QAAQ,GAAG,IAAI,CAAC;KACjB;IAED,IAAI,OAAO,KAAK,KAAK,WAAW,EAAE;QAChC,KAAK,GAAG,QAAQ,CAAC;KAClB;IAGD,SAAS,MAAM,CAAC,MAAW,EAAE,KAAa;QAExC,IAAI,MAAM,KAAK,IAAI,EAAE;YACnB,OAAO,IAAI,CAAC;SACb;QAED,IAAI,KAAK,KAAK,CAAC,EAAE;YACf,OAAO,MAAM,CAAC;SACf;QAED,IAAI,KAAK,CAAC;QACV,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;YAC9B,OAAO,MAAM,CAAC;SACf;QAED,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE;YACnB,KAAK,GAAG,EAAE,CAAC;SACZ;aAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE;YAC3B,KAAK,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;YAC1D,IAAI,MAAM,CAAC,SAAS,EAAE;gBACpB,KAAK,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;aACpC;SACF;aAAM,IAAI,MAAM,CAAC,MAAM,CAAC,EAAE;YACzB,KAAK,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;SACpC;aAAM;YACL,IAAI,OAAO,SAAS,KAAK,WAAW,EAAE;gBACpC,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;aACtD;iBAAM;gBACL,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;aAClC;SACF;QAED,IAAI,QAAQ,EAAE;YACZ,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAEzC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;gBAChB,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;aAC3B;YACD,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxB,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACzB;QAED,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE;YACtB,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;SACzC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC/B,CAAC","file":"clone.js","sourcesContent":["import isArray from './isArray';\nimport isDate from './isDate';\nimport isRegExp from './isRegExp';\n\nfunction getRegExpFlags(re: any) {\n  let flags = '';\n  re.global && (flags += 'g');\n  re.ignoreCase && (flags += 'i');\n  re.multiline && (flags += 'm');\n  return flags;\n}\n\n// Adapted from https://github.com/pvorb/clone by Paul Vorbach\n// License: https://github.com/pvorb/clone/blob/master/LICENSE\nexport default function clone(parent: any, circular = false, depth = 0, prototype: any = undefined) {\n  // maintain two arrays for circular references, where corresponding parents\n  // and children have the same index\n  const allParents: Array<any> = [];\n  const allChildren: Array<any> = [];\n\n  if (typeof circular === 'undefined') {\n    circular = true;\n  }\n\n  if (typeof depth === 'undefined') {\n    depth = Infinity;\n  }\n\n  // recurse this function so we don't reset allParents and allChildren\n  function _clone(parent: any, depth: number) {\n    // cloning null always returns null\n    if (parent === null) {\n      return null;\n    }\n\n    if (depth === 0) {\n      return parent;\n    }\n\n    let child;\n    if (typeof parent !== 'object') {\n      return parent;\n    }\n\n    if (isArray(parent)) {\n      child = [];\n    } else if (isRegExp(parent)) {\n      child = new RegExp(parent.source, getRegExpFlags(parent));\n      if (parent.lastIndex) {\n        child.lastIndex = parent.lastIndex;\n      }\n    } else if (isDate(parent)) {\n      child = new Date(parent.getTime());\n    } else {\n      if (typeof prototype === 'undefined') {\n        child = Object.create(Object.getPrototypeOf(parent));\n      } else {\n        child = Object.create(prototype);\n      }\n    }\n\n    if (circular) {\n      const index = allParents.indexOf(parent);\n\n      if (index !== -1) {\n        return allChildren[index];\n      }\n      allParents.push(parent);\n      allChildren.push(child);\n    }\n\n    for (const i in parent) {\n      child[i] = _clone(parent[i], depth - 1);\n    }\n\n    return child;\n  }\n  return _clone(parent, depth);\n}\n"]}
+{"version":3,"sources":["../src/common/clone.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,MAAM,MAAM,UAAU,CAAC;AAC9B,OAAO,QAAQ,MAAM,YAAY,CAAC;AAElC,SAAS,cAAc,CAAC,EAAO;IAC7B,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,EAAE,CAAC,MAAM,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC;IAC5B,EAAE,CAAC,UAAU,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC;IAChC,EAAE,CAAC,SAAS,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8DAA8D;AAC9D,8DAA8D;AAC9D,MAAM,CAAC,OAAO,UAAU,KAAK,CAAC,MAAW,EAAE,QAAQ,GAAG,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,YAAiB,SAAS;IAChG,2EAA2E;IAC3E,mCAAmC;IACnC,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,MAAM,WAAW,GAAe,EAAE,CAAC;IAEnC,IAAI,OAAO,QAAQ,KAAK,WAAW,EAAE;QACnC,QAAQ,GAAG,IAAI,CAAC;KACjB;IAED,IAAI,OAAO,KAAK,KAAK,WAAW,EAAE;QAChC,KAAK,GAAG,QAAQ,CAAC;KAClB;IAED,qEAAqE;IACrE,SAAS,MAAM,CAAC,MAAW,EAAE,KAAa;QACxC,mCAAmC;QACnC,IAAI,MAAM,KAAK,IAAI,EAAE;YACnB,OAAO,IAAI,CAAC;SACb;QAED,IAAI,KAAK,KAAK,CAAC,EAAE;YACf,OAAO,MAAM,CAAC;SACf;QAED,IAAI,KAAK,CAAC;QACV,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;YAC9B,OAAO,MAAM,CAAC;SACf;QAED,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE;YACnB,KAAK,GAAG,EAAE,CAAC;SACZ;aAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,EAAE;YAC3B,KAAK,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;YAC1D,IAAI,MAAM,CAAC,SAAS,EAAE;gBACpB,KAAK,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;aACpC;SACF;aAAM,IAAI,MAAM,CAAC,MAAM,CAAC,EAAE;YACzB,KAAK,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;SACpC;aAAM;YACL,IAAI,OAAO,SAAS,KAAK,WAAW,EAAE;gBACpC,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;aACtD;iBAAM;gBACL,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;aAClC;SACF;QAED,IAAI,QAAQ,EAAE;YACZ,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAEzC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;gBAChB,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;aAC3B;YACD,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxB,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACzB;QAED,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE;YACtB,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;SACzC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC/B,CAAC","file":"clone.js","sourcesContent":["import isArray from './isArray';\nimport isDate from './isDate';\nimport isRegExp from './isRegExp';\n\nfunction getRegExpFlags(re: any) {\n  let flags = '';\n  re.global && (flags += 'g');\n  re.ignoreCase && (flags += 'i');\n  re.multiline && (flags += 'm');\n  return flags;\n}\n\n// Adapted from https://github.com/pvorb/clone by Paul Vorbach\n// License: https://github.com/pvorb/clone/blob/master/LICENSE\nexport default function clone(parent: any, circular = false, depth = 0, prototype: any = undefined) {\n  // maintain two arrays for circular references, where corresponding parents\n  // and children have the same index\n  const allParents: Array<any> = [];\n  const allChildren: Array<any> = [];\n\n  if (typeof circular === 'undefined') {\n    circular = true;\n  }\n\n  if (typeof depth === 'undefined') {\n    depth = Infinity;\n  }\n\n  // recurse this function so we don't reset allParents and allChildren\n  function _clone(parent: any, depth: number) {\n    // cloning null always returns null\n    if (parent === null) {\n      return null;\n    }\n\n    if (depth === 0) {\n      return parent;\n    }\n\n    let child;\n    if (typeof parent !== 'object') {\n      return parent;\n    }\n\n    if (isArray(parent)) {\n      child = [];\n    } else if (isRegExp(parent)) {\n      child = new RegExp(parent.source, getRegExpFlags(parent));\n      if (parent.lastIndex) {\n        child.lastIndex = parent.lastIndex;\n      }\n    } else if (isDate(parent)) {\n      child = new Date(parent.getTime());\n    } else {\n      if (typeof prototype === 'undefined') {\n        child = Object.create(Object.getPrototypeOf(parent));\n      } else {\n        child = Object.create(prototype);\n      }\n    }\n\n    if (circular) {\n      const index = allParents.indexOf(parent);\n\n      if (index !== -1) {\n        return allChildren[index];\n      }\n      allParents.push(parent);\n      allChildren.push(child);\n    }\n\n    for (const i in parent) {\n      child[i] = _clone(parent[i], depth - 1);\n    }\n\n    return child;\n  }\n  return _clone(parent, depth);\n}\n"]}

package/es/common/cloneDeep.js

@@ -14,8 +14,11 @@ export default function cloneDeep(value, ignoreWhen, excludeKeys) {
     let result;
     if (!isValid(value) || "object" != typeof value || ignoreWhen && ignoreWhen(value)) return value;
     const isArr = isArray(value), length = value.length;
+    // 不考虑特殊数组的额外处理
     result = isArr ? new Array(length) : "object" == typeof value ? {} : isBoolean(value) || isNumber(value) || isString(value) ? value : isDate(value) ? new Date(+value) : void 0;
-    const props = isArr ? void 0 : Object.keys(Object(value));
+    // 不考虑 map / set / TypedArray 类型的赋值
+    // 不考虑对象的 symbol 属性
+        const props = isArr ? void 0 : Object.keys(Object(value));
     let index = -1;
     if (result) for (;++index < (props || value).length; ) {
         const key = props ? props[index] : index, subValue = value[key];

package/es/common/cloneDeep.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/cloneDeep.ts"],"names":[],"mappings":"AAAA,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,SAAS,MAAM,aAAa,CAAC;AACpC,OAAO,MAAM,MAAM,UAAU,CAAC;AAC9B,OAAO,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,OAAO,MAAM,WAAW,CAAC;AAEhC,MAAM,CAAC,OAAO,UAAU,SAAS,CAAC,KAAU,EAAE,UAAoC,EAAE,WAAsB;IACxG,IAAI,MAAM,CAAC;IACX,IAAI,CAAC,OAAO,CAAC,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,OAAO,CAAC,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,SAAS,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;QAC/D,MAAM,GAAG,KAAK,CAAC;KAChB;SAAM,IAAI,MAAM,CAAC,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","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,OAAO,OAAO,MAAM,WAAW,CAAC;AAChC,OAAO,SAAS,MAAM,aAAa,CAAC;AACpC,OAAO,MAAM,MAAM,UAAU,CAAC;AAC9B,OAAO,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,OAAO,MAAM,WAAW,CAAC;AAEhC,MAAM,CAAC,OAAO,UAAU,SAAS,CAAC,KAAU,EAAE,UAAoC,EAAE,WAAsB;IACxG,IAAI,MAAM,CAAC;IACX,IAAI,CAAC,OAAO,CAAC,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,OAAO,CAAC,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,SAAS,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;QAC/D,MAAM,GAAG,KAAK,CAAC;KAChB;SAAM,IAAI,MAAM,CAAC,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","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/es/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/es/common/correlation.js

@@ -0,0 +1,77 @@
+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，不修改数组。 */ export 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);
+}
+//# sourceMappingURL=correlation.js.map

package/es/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,MAAM,UAAU,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","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/es/common/debounce.js

@@ -1,3 +1,6 @@
+/**
+ * @see https://github.com/lodash/lodash/blob/master/debounce.js
+ */
 import isObject from "./isObject";
 
 import isValidNumber from "./isValidNumber";
@@ -12,6 +15,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) {
@@ -24,27 +28,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;
     }