tools-min-ns 1.5.2

package/lib/array/ArrayUtil.js

@@ -0,0 +1,252 @@
+"use strict";
+
+/**
+ * 数组工具
+ * @description
+ * @author nanshen
+ * @creat 2021-09-15 10:31:35
+ */
+var __read = this && this.__read || function (o, n) {
+  var m = typeof Symbol === "function" && o[Symbol.iterator];
+  if (!m) return o;
+  var i = m.call(o),
+    r,
+    ar = [],
+    e;
+  try {
+    while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+  } catch (error) {
+    e = {
+      error: error
+    };
+  } finally {
+    try {
+      if (r && !r.done && (m = i["return"])) m.call(i);
+    } finally {
+      if (e) throw e.error;
+    }
+  }
+  return ar;
+};
+var __spreadArray = this && this.__spreadArray || function (to, from, pack) {
+  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+    if (ar || !(i in from)) {
+      if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+      ar[i] = from[i];
+    }
+  }
+  return to.concat(ar || Array.prototype.slice.call(from));
+};
+var __importDefault = this && this.__importDefault || function (mod) {
+  return mod && mod.__esModule ? mod : {
+    "default": mod
+  };
+};
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var NumberUtil_1 = __importDefault(require("../number/NumberUtil"));
+var ArrayUtil;
+(function (ArrayUtil) {
+  /**
+   *  对象数组去重
+   * @param array 去重对象
+   * @param key 去重key
+   * @param isSaveLast 默认true ，true返回重复最后一个对象，false返回重复第一个对象
+   * @example
+   * const array = [{a:1,b:3},{a:1,b:2},{a:2,b:1}]
+   * arrayWeightRemoval(array,'a',true) => [{a:1,b:2},{a:2,b:1}]
+   * arrayWeightRemoval(array,'a',false) => [{a:1,b:3},{a:2,b:1}]
+   */
+  ArrayUtil.arrayWeightRemoval = function (array, key, isSaveLast) {
+    var _a;
+    if (array === void 0) {
+      array = [];
+    }
+    if (isSaveLast === void 0) {
+      isSaveLast = true;
+    }
+    if (!array.length || key === undefined || ((_a = array === null || array === void 0 ? void 0 : array[0]) === null || _a === void 0 ? void 0 : _a[key]) === undefined) {
+      return [];
+    }
+    var arrayMap = new Map();
+    var region = [];
+    array.forEach(function (element) {
+      if (isSaveLast) {
+        arrayMap.set(element[key], element);
+      } else {
+        if (!arrayMap.has(element[key])) arrayMap.set(element[key], element);
+      }
+    });
+    arrayMap.forEach(function (ele) {
+      if (ele) {
+        region.push(ele);
+      }
+    });
+    return region;
+  };
+  /**
+   * 数组去重
+   * @param { (number | string)[]} arr 数组
+   * @example
+   * unique([1,3,1]) =>[1,3]
+   */
+  ArrayUtil.unique = function (arr) {
+    if (!(arr === null || arr === void 0 ? void 0 : arr.length)) return [];
+    var list = __spreadArray([], __read(new Set(arr)), false);
+    return list;
+  };
+  /**
+   * 求两个集合的并集
+   * @param { (number | string)[]} a 集合a
+   * @param { (number | string)[]} b 集合b
+   * @example
+   * union([1,3,4],[1,2]) => [1,2,3,4]
+   */
+  ArrayUtil.union = function (a, b) {
+    if (!(a === null || a === void 0 ? void 0 : a.length)) return [];
+    if (!(b === null || b === void 0 ? void 0 : b.length)) return [];
+    var aArr = new Set(a);
+    var bArr = new Set(b);
+    var list = __spreadArray([], __read(new Set(__spreadArray(__spreadArray([], __read(aArr), false), __read(bArr), false))), false);
+    return list;
+  };
+  /**
+   * 求两个集合的交集
+   * @param { (number | string)[]} a 集合a
+   * @param { (number | string)[]} b 集合b
+   * @example
+   * intersect([1,3,4],[1,2]) => [1]
+   */
+  ArrayUtil.intersect = function (a, b) {
+    if (!(a === null || a === void 0 ? void 0 : a.length)) return [];
+    if (!(b === null || b === void 0 ? void 0 : b.length)) return [];
+    var aArr = new Set(a);
+    var bArr = new Set(b);
+    var list = __spreadArray([], __read(new Set(__spreadArray([], __read(aArr), false).filter(function (x) {
+      return bArr.has(x);
+    }))), false);
+    return list;
+  };
+  /**
+   * 求两个集合的差集
+   * @param { (number | string)[]} a 集合a
+   * @param { (number | string)[]} b 集合b
+   * @example
+   * difference([1,2,3],[1]) => [2,3]
+   */
+  ArrayUtil.difference = function (a, b) {
+    var aArr = new Set(a);
+    var bArr = new Set(b);
+    var list = __spreadArray([], __read(new Set(__spreadArray([], __read(aArr), false).filter(function (x) {
+      return !bArr.has(x);
+    }))), false);
+    return list;
+  };
+  /**
+   * 最大值
+   * @param {number[]} arr 数组
+   * @example
+   * max([1,2,3]) => 3
+   */
+  ArrayUtil.max = function (arr) {
+    if (!(arr === null || arr === void 0 ? void 0 : arr.length)) return 0;
+    return Math.max.apply(null, arr);
+  };
+  /**
+   * 最小值
+   * @export
+   * @param {number[]} arr 数组
+   * @example
+   * min([1,2,3]) => 1
+   */
+  ArrayUtil.min = function (arr) {
+    if (!(arr === null || arr === void 0 ? void 0 : arr.length)) return 0;
+    return Math.min.apply(null, arr);
+  };
+  /**
+   * 求和
+   * @export
+   * @param {number[]} arr 数字数组
+   * @example
+   * sum([1,2]) => 3
+   */
+  ArrayUtil.sum = function (arr) {
+    return arr.reduce(function (a, b) {
+      return NumberUtil_1.default.floatAdd(a, b);
+    }, 0);
+  };
+  /**
+   * 平均值
+   * @export
+   * @param {number[]} arr 数字数组
+   * @example
+   * average([1,2,3]) => 2
+   */
+  ArrayUtil.average = function (arr) {
+    if (!(arr === null || arr === void 0 ? void 0 : arr.length)) return 0;
+    return ArrayUtil.sum(arr) / arr.length;
+  };
+  /**
+   * 删除其中一个元素
+   * @export
+   * @param {(number | string)[]} arr 数组
+   * @param {(number | string)} ele 要删除的元素
+   * @example
+   * remove([1,2,3],3) => [1,2]
+   */
+  ArrayUtil.remove = function (arr, ele) {
+    if (!(arr === null || arr === void 0 ? void 0 : arr.length)) return [];
+    var index = arr.indexOf(ele);
+    if (index > -1) {
+      arr.splice(index, 1);
+    }
+    return arr;
+  };
+  /**
+   * 数组排序
+   * @param  {number[]} arr 数组
+   * @param  {number} type 1：从小到大   2：从大到小   3：随机
+   * @example
+   * sort([1,2,3],1) => [1,2,3]
+   * sort([1,2,3],2) => [3,2,1]
+   * sort([1,2,3],3) => [1,3,2]
+   */
+  ArrayUtil.sort = function (arr, type) {
+    if (type === void 0) {
+      type = 1;
+    }
+    if (!(arr === null || arr === void 0 ? void 0 : arr.length)) return [];
+    return arr.sort(function (a, b) {
+      switch (type) {
+        case 1:
+          return a - b;
+        case 2:
+          return b - a;
+        case 3:
+          return Math.random() - 0.5;
+        default:
+          return a - b;
+      }
+    });
+  };
+  /**
+   * 随机排序数组
+   * @param arr any[]
+   * @example
+   * randomSortArr([1,2,3]) => [1,3,2]
+   * randomSortArr([{a:1},{a:2},{a:3}]) => [{a:3},{a:1},{a:2}]
+   */
+  function randomSortArr(arr) {
+    var _a;
+    return new Array((_a = arr === null || arr === void 0 ? void 0 : arr.length) !== null && _a !== void 0 ? _a : 0).fill(0).map(function (_, i) {
+      return i;
+    }).sort(function () {
+      return Math.random() - 0.5;
+    }).map(function (index) {
+      return arr[index];
+    });
+  }
+  ArrayUtil.randomSortArr = randomSortArr;
+})(ArrayUtil || (ArrayUtil = {}));
+exports.default = ArrayUtil;

package/lib/array/TreeUtil.d.ts

@@ -0,0 +1,151 @@
+/**
+ * 树工具
+ * @description
+ * @author nanshen
+ * @creat 2021-09-15 10:31:35
+ */
+import { FieldNames, TreeData, ValueType } from '../types';
+declare namespace TreeUtil {
+    /**
+     * @name 循环树改变原数组
+     * @param tree tree数组
+     * @param callback 回调(item:当前循环项,parent: 父对象)
+     * @param children children字段
+     * @param defaultParent 默认上级对象
+     *
+     */
+    function forEachTree<T>(tree: T[], callback: (t: T, p?: T) => void, children?: string, defaultParent?: T): T[];
+    /**
+     * @name 查找树
+     * @param tree tree数组
+     * @param callback 回调(item:当前循环项,parent: 父对象)
+     * @param children children字段
+     * @param defaultParent 默认上级对象
+     */
+    function findTreeData<T>(tree: T[], callback: (t: T, p?: T) => boolean, children?: string, defaultParent?: T): T | undefined;
+    /**
+     * @name 筛选树
+     * @param tree tree数组
+     * @param callback 回调(item:当前循环项,parent: 父对象)
+     * @param children children字段
+     * @param defaultParent 默认上级对象
+     */
+    function filterTreeData<T>(tree: T[], callback: (t: T, p?: T) => boolean, children?: string, defaultParent?: T): T[];
+    /**
+     * @name 列表转树
+     * @param list 数组
+     * @param fieldNames 映射对象
+     */
+    function getTreeByList<T>(list: T[], fieldNames?: FieldNames): (T & TreeData)[];
+    /**
+     * @name 树转列表
+     * @param tree 数组
+     */
+    function getListByTree<T>(tree: T[], children?: string): T[];
+    /**
+     * @name 获取树中id路径数组
+     * @param tree 树
+     * @param id 主键
+     * @param fieldNames 映射对象
+     */
+    function getIdPathByTree<T>(tree: T[], id: ValueType, fieldNames?: FieldNames): ValueType[];
+    /**
+     * @name 字符串分割转为树结构
+     * @param str string
+     * @param splitStr /
+     * @param fieldNames 映射对象
+     * @example
+   *
+   * `一级选项 1/二级选项 1/三级选项 1
+      一级选项 1/二级选项 1/三级选项 2
+      一级选项 2/二级选项 1`
+      //转换后
+      [
+        {
+          name: '一级选项 1',
+          id: '一级选项 1',
+          children: [
+            {
+              name: '二级选项 1',
+              id: '二级选项 1',
+              pid: '一级选项 1',
+              children: [
+                {
+                  name: '三级选项 1',
+                  id: '三级选项 1',
+                  pid: '二级选项 1',
+                },
+                {
+                  name: '三级选项 2',
+                  id: '三级选项 2',
+                  pid: '二级选项 1',
+                },
+              ],
+            },
+          ],
+        },
+        {
+          name: '一级选项 2',
+          id: '一级选项 2',
+          children: [
+            {
+              name: '二级选项 1',
+              id: '二级选项 1',
+              pid: '一级选项 2',
+            },
+          ],
+        },
+      ]
+     */
+    function strSplit2tree(str: string, splitStr?: string, fieldNames?: FieldNames): Record<string, any>[];
+    /**
+     * @name 树结构转为字符串分割
+   * @param tree 树
+     * @param splitStr /
+     * @param fieldNames 映射对象
+     * @example
+   *
+   * [
+        {
+          name: '一级选项 1',
+          id: '一级选项 1',
+          children: [
+            {
+              name: '二级选项 1',
+              id: '二级选项 1',
+              pid: '一级选项 1',
+              children: [
+                {
+                  name: '三级选项 1',
+                  id: '三级选项 1',
+                  pid: '二级选项 1',
+                },
+                {
+                  name: '三级选项 2',
+                  id: '三级选项 2',
+                  pid: '二级选项 1',
+                },
+              ],
+            },
+          ],
+        },
+        {
+          name: '一级选项 2',
+          id: '一级选项 2',
+          children: [
+            {
+              name: '二级选项 1',
+              id: '二级选项 1',
+              pid: '一级选项 2',
+            },
+          ],
+        },
+      ]
+      //转换后
+      `一级选项 1/二级选项 1/三级选项 1
+      一级选项 1/二级选项 1/三级选项 2
+      一级选项 2/二级选项 1`
+     */
+    function tree2strSplit<T>(tree: T[], splitStr?: string, fieldNames?: FieldNames): string;
+}
+export default TreeUtil;