qmwts 1.1.53 → 1.1.55

package/dist/utils/array-utils.d.ts

@@ -7,5 +7,28 @@ declare const _default: {
      * @param childrenKey 下级字段
      */
     treeify<T>(array?: any[], idKey?: string, parentKey?: string, childrenKey?: string): T[];
+    /**
+     * 查询祖先
+     * @param array 数组
+     * @param id 查询指定id的祖先
+     * @param idKey id的key
+     * @param parentKey parent的key
+     */
+    getAncestors<T>(array: any[] | undefined, id: any, idKey?: string, parentKey?: string): T[];
+    /**
+     * 查询后代
+     * @param array 数组
+     * @param id 查询指定id的祖先
+     * @param idKey id的key
+     * @param parentKey parent的key
+     */
+    getDescendants<T>(array: any[] | undefined, id: any, idKey?: string, parentKey?: string): T[];
+    /**
+     * 根据数组中的某一属性去重
+     * @param array
+     * @param keyName
+     * @param onDuplicate key重复是的行为，override=覆盖，ignore=忽略
+     */
+    uniqueBy<T>(array?: any[], keyName?: any, onDuplicate?: "override" | "ignore"): T[];
 };
 export default _default;

package/dist/utils/array-utils.js

@@ -27,7 +27,7 @@ exports.default = {
         var map = new Map(); // 先根据每项的parentId将该项放入Map
         var ids = []; // 记录所有的id，parentId不在这个集合内则说明是最上级
         for (var i = array.length - 1; i >= 0; i--) {
-            var _a = array, _b = i, e = _a[_b], _c = e, _d = idKey, id = _c[_d], _e = parentKey, pid = _c[_e];
+            var e = array[i], id = e[idKey], pid = e[parentKey];
             var children = map.get(pid) || [];
             children.unshift(__assign({}, e));
             map.set(pid, children);
@@ -36,11 +36,87 @@ exports.default = {
         var o = [];
         var values = Array.from(map.values()).flat();
         for (var i = values.length - 1; i >= 0; i--) {
-            var _f = values, _g = i, e = _f[_g], _h = e, _j = idKey, id = _h[_j], _k = parentKey, pid = _h[_k];
+            var e = values[i], id = e[idKey], pid = e[parentKey];
             e[childrenKey] = map.get(id); // 赋值children
             if (!ids.includes(pid)) // 只返回最上级
                 o.unshift(e);
         }
         return o;
+    },
+    /**
+     * 查询祖先
+     * @param array 数组
+     * @param id 查询指定id的祖先
+     * @param idKey id的key
+     * @param parentKey parent的key
+     */
+    getAncestors: function (array, id, idKey, parentKey) {
+        if (array === void 0) { array = []; }
+        if (idKey === void 0) { idKey = 'id'; }
+        if (parentKey === void 0) { parentKey = 'parentId'; }
+        // 建立 id - item 的映射
+        var idMap = new Map();
+        for (var i = array.length - 1; i >= 0; i--) {
+            var e = array[i], _a = e, _b = idKey, itemId = _a[_b];
+            idMap.set(itemId, e);
+        }
+        var result = [];
+        var current = idMap.get(id);
+        while (current) {
+            var parentId = current[parentKey];
+            var parent_1 = idMap.get(parentId);
+            if (parent_1) {
+                result.unshift(parent_1);
+                current = parent_1;
+            }
+            else {
+                break;
+            }
+        }
+        return result;
+    },
+    /**
+     * 查询后代
+     * @param array 数组
+     * @param id 查询指定id的祖先
+     * @param idKey id的key
+     * @param parentKey parent的key
+     */
+    getDescendants: function (array, id, idKey, parentKey) {
+        if (array === void 0) { array = []; }
+        if (idKey === void 0) { idKey = 'id'; }
+        if (parentKey === void 0) { parentKey = 'parentId'; }
+        var result = [];
+        var dfs = function (currentId) {
+            for (var i = array.length - 1; i >= 0; i--) {
+                var e = array[i], itemId = e[idKey], pid = e[parentKey];
+                if (pid === currentId) {
+                    result.unshift(e);
+                    dfs(itemId);
+                }
+            }
+        };
+        dfs(id);
+        return result;
+    },
+    /**
+     * 根据数组中的某一属性去重
+     * @param array
+     * @param keyName
+     * @param onDuplicate key重复是的行为，override=覆盖，ignore=忽略
+     */
+    uniqueBy: function (array, keyName, onDuplicate) {
+        if (array === void 0) { array = []; }
+        if (keyName === void 0) { keyName = 'id'; }
+        if (onDuplicate === void 0) { onDuplicate = 'ignore'; }
+        var map = new Map();
+        for (var i = array.length - 1; i >= 0; i--) {
+            var e = array[i];
+            var key = e[keyName];
+            if (onDuplicate === 'ignore' && map.has(key))
+                continue;
+            map.set(key, e);
+        }
+        return Array.from(map.values()).reverse();
     }
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "qmwts",
-  "version": "1.1.53",
+  "version": "1.1.55",
   "description": "",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",