@yelon/util 12.0.17 → 13.0.0

package/fesm2015/{yelon-util-array.js → array.mjs}

@@ -1,257 +1,255 @@
 import * as i0 from '@angular/core';
 import { Injectable } from '@angular/core';
-import * as i1 from '@yelon/util/config';
-import { YunzaiConfigService } from '@yelon/util/config';
 import { NzTreeNode } from 'ng-zorro-antd/core/tree';
+import * as i1 from '@yelon/util/config';
 
-/* eslint-disable @typescript-eslint/no-explicit-any */
-class ArrayService {
-    constructor(cog) {
-        this.c = cog.merge('utilArray', {
-            deepMapName: 'deep',
-            parentMapName: 'parent',
-            idMapName: 'id',
-            parentIdMapName: 'parent_id',
-            childrenMapName: 'children',
-            titleMapName: 'title',
-            checkedMapname: 'checked',
-            selectedMapname: 'selected',
-            expandedMapname: 'expanded',
-            disabledMapname: 'disabled'
-        });
-    }
-    /**
-     * Convert tree structure to array structure
-     *
-     * 将树结构转换成数组结构
-     */
-    treeToArr(tree, options) {
-        const opt = Object.assign({ deepMapName: this.c.deepMapName, parentMapName: this.c.parentMapName, childrenMapName: this.c.childrenMapName, clearChildren: true, cb: null }, options);
-        const result = [];
-        const inFn = (list, parent, deep = 0) => {
-            for (const i of list) {
-                i[opt.deepMapName] = deep;
-                i[opt.parentMapName] = parent;
-                if (opt.cb) {
-                    opt.cb(i, parent, deep);
-                }
-                result.push(i);
-                const children = i[opt.childrenMapName];
-                if (children != null && Array.isArray(children) && children.length > 0) {
-                    inFn(children, i, deep + 1);
-                }
-                if (opt.clearChildren) {
-                    delete i[opt.childrenMapName];
-                }
-            }
-        };
-        inFn(tree, null);
-        return result;
-    }
-    /**
-     * Convert array structure to tree structure
-     *
-     * 数组转换成树数据
-     */
-    arrToTree(arr, options) {
-        if (!Array.isArray(arr) || arr.length === 0) {
-            return [];
-        }
-        const opt = Object.assign({ idMapName: this.c.idMapName, parentIdMapName: this.c.parentIdMapName, childrenMapName: this.c.childrenMapName, cb: null }, options);
-        const tree = [];
-        const childrenOf = {};
-        let rootPid = opt.rootParentIdValue;
-        const arrType = arr;
-        if (!rootPid) {
-            const pids = arrType.map(i => i[opt.parentIdMapName]);
-            const emptyPid = pids.findIndex(w => w == null);
-            rootPid = emptyPid !== -1 ? pids[emptyPid] : pids.sort()[0];
-        }
-        for (const item of arrType) {
-            const id = item[opt.idMapName];
-            const pid = item[opt.parentIdMapName];
-            childrenOf[id] = childrenOf[id] || [];
-            item[opt.childrenMapName] = childrenOf[id];
-            if (opt.cb) {
-                opt.cb(item);
-            }
-            if (pid !== rootPid) {
-                childrenOf[pid] = childrenOf[pid] || [];
-                childrenOf[pid].push(item);
-            }
-            else {
-                tree.push(item);
-            }
-        }
-        return tree;
-    }
-    /**
-     * 数组转换成 `nz-tree` 数据源，通过 `options` 转化项名，也可以使用 `options.cb` 更高级决定数据项
-     */
-    arrToTreeNode(arr, options) {
-        const opt = Object.assign({ idMapName: this.c.idMapName, parentIdMapName: this.c.parentIdMapName, titleMapName: this.c.titleMapName, isLeafMapName: 'isLeaf', checkedMapname: this.c.checkedMapname, selectedMapname: this.c.selectedMapname, expandedMapname: this.c.expandedMapname, disabledMapname: this.c.disabledMapname, cb: null }, options);
-        const tree = this.arrToTree(arr, {
-            idMapName: opt.idMapName,
-            parentIdMapName: opt.parentIdMapName,
-            childrenMapName: 'children'
-        });
-        this.visitTree(tree, (item, parent, deep) => {
-            item.key = item[opt.idMapName];
-            item.title = item[opt.titleMapName];
-            item.checked = item[opt.checkedMapname];
-            item.selected = item[opt.selectedMapname];
-            item.expanded = item[opt.expandedMapname];
-            item.disabled = item[opt.disabledMapname];
-            if (item[opt.isLeafMapName] == null) {
-                item.isLeaf = item.children.length === 0;
-            }
-            else {
-                item.isLeaf = item[opt.isLeafMapName];
-            }
-            if (opt.cb) {
-                opt.cb(item, parent, deep);
-            }
-        });
-        return tree.map(node => new NzTreeNode(node));
-    }
-    /**
-     * 递归访问整个树
-     */
-    visitTree(tree, cb, options) {
-        options = Object.assign({ childrenMapName: this.c.childrenMapName }, options);
-        const inFn = (data, parent, deep) => {
-            for (const item of data) {
-                cb(item, parent, deep);
-                const childrenVal = item[options.childrenMapName];
-                if (Array.isArray(childrenVal) && childrenVal.length > 0) {
-                    inFn(childrenVal, item, deep + 1);
-                }
-            }
-        };
-        inFn(tree, null, 1);
-    }
-    /**
-     * Return the value of the first tree value in the tree where predicate is true, and `undefined` otherwise
-     *
-     * 根据条件返回树的第一个值，否则返回 `undefined`
-     */
-    findTree(tree, predicate, options) {
-        let res;
-        this.visitTree(tree, item => {
-            if (res === undefined && predicate(item)) {
-                res = item;
-            }
-        }, options);
-        return res;
-    }
-    /**
-     * 获取所有已经选中的 `key` 值
-     */
-    getKeysByTreeNode(tree, options) {
-        const opt = Object.assign({ includeHalfChecked: true }, options);
-        const keys = [];
-        this.visitTree(tree, (item, parent, deep) => {
-            if (item.isChecked || (opt.includeHalfChecked && item.isHalfChecked)) {
-                keys.push(opt.cb ? opt.cb(item, parent, deep) : opt.keyMapName ? item.origin[opt.keyMapName] : item.key);
-            }
-        });
-        return keys;
-    }
-    baseFlat(array, depth, result = []) {
-        let index = -1;
-        while (++index < array.length) {
-            const value = array[index];
-            if (depth > 0 && Array.isArray(value)) {
-                if (depth > 1) {
-                    this.baseFlat(value, depth - 1, result);
-                }
-                else {
-                    let pushIndex = -1;
-                    const offset = result.length;
-                    while (++pushIndex < value.length) {
-                        result[offset + pushIndex] = value[pushIndex];
-                    }
-                }
-            }
-            else {
-                result[result.length] = value;
-            }
-        }
-        return result;
-    }
-    /**
-     * Recursively flattens array
-     *
-     * 递归扁平数组
-     * ```ts
-     * srv.flat([1, [2, 3, [4, 5, [6]]]]) => [1,2,3,4,5,6]
-     * srv.flat([1, [2, 3, [4, 5, [6]]]], 1) => [1,2,3,[4, 5, [6]]]
-     * ```
-     */
-    flat(array, depth = 1 / 0) {
-        return Array.isArray(array) ? this.baseFlat(array, depth) : array;
-    }
-    /**
-     * Group the array
-     *
-     * 对数组进行分组
-     * ```ts
-     * srv.groupBy([6.1, 4.2, 6.3], Math.floor) => {"4":[4.2],"6":[6.1,6.3]}
-     * srv.groupBy(['one', 'two', 'three'], v => v.length) => {"3":["one","two"],"5":["three"]}
-     * ```
-     */
-    groupBy(array, iteratee) {
-        if (!Array.isArray(array)) {
-            return {};
-        }
-        return array.reduce((result, value) => {
-            const key = iteratee(value);
-            if (Object.prototype.hasOwnProperty.call(result, key)) {
-                result[key].push(value);
-            }
-            else {
-                result[key] = [value];
-            }
-            return result;
-        }, {});
-    }
-    /**
-     * Creates a duplicate-free version of an array
-     *
-     * 创建去重后的数组
-     * ```ts
-     * uniq([1, 2, 2, 3, 1]) => [1,2,3]
-     * uniq([{ a: 1 }, { a: 1 }, { a: 2 }], 'a') => [{"a":1},{"a":2}]
-     * uniq([{ a: 1 }, { a: 1 }, { a: 2 }], i => (i.a === 1 ? 'a' : 'b')) => [{"a":1},{"a":2}]
-     * ```
-     */
-    uniq(array, predicate) {
-        return Array.from(array
-            .reduce((map, value) => {
-            const key = predicate
-                ? typeof predicate === 'string'
-                    ? value[predicate]
-                    : predicate(value)
-                : value;
-            if (!map.has(key)) {
-                map.set(key, value);
-            }
-            return map;
-        }, new Map())
-            .values());
-    }
-}
-ArrayService.ɵprov = i0.ɵɵdefineInjectable({ factory: function ArrayService_Factory() { return new ArrayService(i0.ɵɵinject(i1.YunzaiConfigService)); }, token: ArrayService, providedIn: "root" });
-ArrayService.decorators = [
-    { type: Injectable, args: [{ providedIn: 'root' },] }
-];
-ArrayService.ctorParameters = () => [
-    { type: YunzaiConfigService }
-];
+/* eslint-disable @typescript-eslint/no-explicit-any */
+class ArrayService {
+    constructor(cog) {
+        this.c = cog.merge('utilArray', {
+            deepMapName: 'deep',
+            parentMapName: 'parent',
+            idMapName: 'id',
+            parentIdMapName: 'parent_id',
+            childrenMapName: 'children',
+            titleMapName: 'title',
+            checkedMapname: 'checked',
+            selectedMapname: 'selected',
+            expandedMapname: 'expanded',
+            disabledMapname: 'disabled'
+        });
+    }
+    /**
+     * Convert tree structure to array structure
+     *
+     * 将树结构转换成数组结构
+     */
+    treeToArr(tree, options) {
+        const opt = Object.assign({ deepMapName: this.c.deepMapName, parentMapName: this.c.parentMapName, childrenMapName: this.c.childrenMapName, clearChildren: true, cb: null }, options);
+        const result = [];
+        const inFn = (list, parent, deep = 0) => {
+            for (const i of list) {
+                i[opt.deepMapName] = deep;
+                i[opt.parentMapName] = parent;
+                if (opt.cb) {
+                    opt.cb(i, parent, deep);
+                }
+                result.push(i);
+                const children = i[opt.childrenMapName];
+                if (children != null && Array.isArray(children) && children.length > 0) {
+                    inFn(children, i, deep + 1);
+                }
+                if (opt.clearChildren) {
+                    delete i[opt.childrenMapName];
+                }
+            }
+        };
+        inFn(tree, null);
+        return result;
+    }
+    /**
+     * Convert array structure to tree structure
+     *
+     * 数组转换成树数据
+     */
+    arrToTree(arr, options) {
+        if (!Array.isArray(arr) || arr.length === 0) {
+            return [];
+        }
+        const opt = Object.assign({ idMapName: this.c.idMapName, parentIdMapName: this.c.parentIdMapName, childrenMapName: this.c.childrenMapName, cb: null }, options);
+        const tree = [];
+        const childrenOf = {};
+        let rootPid = opt.rootParentIdValue;
+        const arrType = arr;
+        if (!rootPid) {
+            const pids = arrType.map(i => i[opt.parentIdMapName]);
+            const emptyPid = pids.findIndex(w => w == null);
+            rootPid = emptyPid !== -1 ? pids[emptyPid] : pids.sort()[0];
+        }
+        for (const item of arrType) {
+            const id = item[opt.idMapName];
+            const pid = item[opt.parentIdMapName];
+            childrenOf[id] = childrenOf[id] || [];
+            item[opt.childrenMapName] = childrenOf[id];
+            if (opt.cb) {
+                opt.cb(item);
+            }
+            if (pid !== rootPid) {
+                childrenOf[pid] = childrenOf[pid] || [];
+                childrenOf[pid].push(item);
+            }
+            else {
+                tree.push(item);
+            }
+        }
+        return tree;
+    }
+    /**
+     * 数组转换成 `nz-tree` 数据源，通过 `options` 转化项名，也可以使用 `options.cb` 更高级决定数据项
+     */
+    arrToTreeNode(arr, options) {
+        const opt = Object.assign({ idMapName: this.c.idMapName, parentIdMapName: this.c.parentIdMapName, titleMapName: this.c.titleMapName, isLeafMapName: 'isLeaf', checkedMapname: this.c.checkedMapname, selectedMapname: this.c.selectedMapname, expandedMapname: this.c.expandedMapname, disabledMapname: this.c.disabledMapname, cb: null }, options);
+        const tree = this.arrToTree(arr, {
+            idMapName: opt.idMapName,
+            parentIdMapName: opt.parentIdMapName,
+            childrenMapName: 'children'
+        });
+        this.visitTree(tree, (item, parent, deep) => {
+            item.key = item[opt.idMapName];
+            item.title = item[opt.titleMapName];
+            item.checked = item[opt.checkedMapname];
+            item.selected = item[opt.selectedMapname];
+            item.expanded = item[opt.expandedMapname];
+            item.disabled = item[opt.disabledMapname];
+            if (item[opt.isLeafMapName] == null) {
+                item.isLeaf = item.children.length === 0;
+            }
+            else {
+                item.isLeaf = item[opt.isLeafMapName];
+            }
+            if (opt.cb) {
+                opt.cb(item, parent, deep);
+            }
+        });
+        return tree.map(node => new NzTreeNode(node));
+    }
+    /**
+     * 递归访问整个树
+     */
+    visitTree(tree, cb, options) {
+        options = Object.assign({ childrenMapName: this.c.childrenMapName }, options);
+        const inFn = (data, parent, deep) => {
+            for (const item of data) {
+                cb(item, parent, deep);
+                const childrenVal = item[options.childrenMapName];
+                if (Array.isArray(childrenVal) && childrenVal.length > 0) {
+                    inFn(childrenVal, item, deep + 1);
+                }
+            }
+        };
+        inFn(tree, null, 1);
+    }
+    /**
+     * Return the value of the first tree value in the tree where predicate is true, and `undefined` otherwise
+     *
+     * 根据条件返回树的第一个值，否则返回 `undefined`
+     */
+    findTree(tree, predicate, options) {
+        let res;
+        this.visitTree(tree, item => {
+            if (res === undefined && predicate(item)) {
+                res = item;
+            }
+        }, options);
+        return res;
+    }
+    /**
+     * 获取所有已经选中的 `key` 值
+     */
+    getKeysByTreeNode(tree, options) {
+        const opt = Object.assign({ includeHalfChecked: true }, options);
+        const keys = [];
+        this.visitTree(tree, (item, parent, deep) => {
+            if (item.isChecked || (opt.includeHalfChecked && item.isHalfChecked)) {
+                keys.push(opt.cb ? opt.cb(item, parent, deep) : opt.keyMapName ? item.origin[opt.keyMapName] : item.key);
+            }
+        });
+        return keys;
+    }
+    baseFlat(array, depth, result = []) {
+        let index = -1;
+        while (++index < array.length) {
+            const value = array[index];
+            if (depth > 0 && Array.isArray(value)) {
+                if (depth > 1) {
+                    this.baseFlat(value, depth - 1, result);
+                }
+                else {
+                    let pushIndex = -1;
+                    const offset = result.length;
+                    while (++pushIndex < value.length) {
+                        result[offset + pushIndex] = value[pushIndex];
+                    }
+                }
+            }
+            else {
+                result[result.length] = value;
+            }
+        }
+        return result;
+    }
+    /**
+     * Recursively flattens array
+     *
+     * 递归扁平数组
+     * ```ts
+     * srv.flat([1, [2, 3, [4, 5, [6]]]]) => [1,2,3,4,5,6]
+     * srv.flat([1, [2, 3, [4, 5, [6]]]], 1) => [1,2,3,[4, 5, [6]]]
+     * ```
+     */
+    flat(array, depth = 1 / 0) {
+        return Array.isArray(array) ? this.baseFlat(array, depth) : array;
+    }
+    /**
+     * Group the array
+     *
+     * 对数组进行分组
+     * ```ts
+     * srv.groupBy([6.1, 4.2, 6.3], Math.floor) => {"4":[4.2],"6":[6.1,6.3]}
+     * srv.groupBy(['one', 'two', 'three'], v => v.length) => {"3":["one","two"],"5":["three"]}
+     * ```
+     */
+    groupBy(array, iteratee) {
+        if (!Array.isArray(array)) {
+            return {};
+        }
+        return array.reduce((result, value) => {
+            const key = iteratee(value);
+            if (Object.prototype.hasOwnProperty.call(result, key)) {
+                result[key].push(value);
+            }
+            else {
+                result[key] = [value];
+            }
+            return result;
+        }, {});
+    }
+    /**
+     * Creates a duplicate-free version of an array
+     *
+     * 创建去重后的数组
+     * ```ts
+     * uniq([1, 2, 2, 3, 1]) => [1,2,3]
+     * uniq([{ a: 1 }, { a: 1 }, { a: 2 }], 'a') => [{"a":1},{"a":2}]
+     * uniq([{ a: 1 }, { a: 1 }, { a: 2 }], i => (i.a === 1 ? 'a' : 'b')) => [{"a":1},{"a":2}]
+     * ```
+     */
+    uniq(array, predicate) {
+        return Array.from(array
+            .reduce((map, value) => {
+            const key = predicate
+                ? typeof predicate === 'string'
+                    ? value[predicate]
+                    : predicate(value)
+                : value;
+            if (!map.has(key)) {
+                map.set(key, value);
+            }
+            return map;
+        }, new Map())
+            .values());
+    }
+}
+ArrayService.ɵfac = i0.ɵɵngDeclareFactory({ minVersion: "12.0.0", version: "13.1.1", ngImport: i0, type: ArrayService, deps: [{ token: i1.YunzaiConfigService }], target: i0.ɵɵFactoryTarget.Injectable });
+ArrayService.ɵprov = i0.ɵɵngDeclareInjectable({ minVersion: "12.0.0", version: "13.1.1", ngImport: i0, type: ArrayService, providedIn: 'root' });
+i0.ɵɵngDeclareClassMetadata({ minVersion: "12.0.0", version: "13.1.1", ngImport: i0, type: ArrayService, decorators: [{
+            type: Injectable,
+            args: [{ providedIn: 'root' }]
+        }], ctorParameters: function () { return [{ type: i1.YunzaiConfigService }]; } });
 
-/**
- * Generated bundle index. Do not edit.
+/**
+ * Generated bundle index. Do not edit.
  */
 
 export { ArrayService };
-//# sourceMappingURL=yelon-util-array.js.map
+//# sourceMappingURL=array.mjs.map

package/fesm2015/array.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.mjs","sources":["../../../../packages/util/array/array.service.ts","../../../../packages/util/array/array.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-explicit-any */\nimport { Injectable } from '@angular/core';\n\nimport { YunzaiConfigService, YunzaiUtilArrayConfig } from '@yelon/util/config';\nimport { NzTreeNode } from 'ng-zorro-antd/core/tree';\n\nimport {\n  ArrayServiceArrToTreeNodeOptions,\n  ArrayServiceArrToTreeOptions,\n  ArrayServiceGetKeysByTreeNodeOptions,\n  ArrayServiceGroupByResult,\n  ArrayServiceTreeToArrOptions\n} from './array-type.service';\n\n@Injectable({ providedIn: 'root' })\nexport class ArrayService {\n  private c: YunzaiUtilArrayConfig;\n\n  constructor(cog: YunzaiConfigService) {\n    this.c = cog.merge('utilArray', {\n      deepMapName: 'deep',\n      parentMapName: 'parent',\n      idMapName: 'id',\n      parentIdMapName: 'parent_id',\n      childrenMapName: 'children',\n      titleMapName: 'title',\n      checkedMapname: 'checked',\n      selectedMapname: 'selected',\n      expandedMapname: 'expanded',\n      disabledMapname: 'disabled'\n    })!;\n  }\n\n  /**\n   * Convert tree structure to array structure\n   *\n   * 将树结构转换成数组结构\n   */\n  treeToArr<T extends object = any>(tree: readonly T[], options?: ArrayServiceTreeToArrOptions<T>): T[] {\n    const opt = {\n      deepMapName: this.c.deepMapName,\n      parentMapName: this.c.parentMapName,\n      childrenMapName: this.c.childrenMapName,\n      clearChildren: true,\n      cb: null,\n      ...options\n    } as ArrayServiceTreeToArrOptions;\n    const result: Array<{ [key: string]: any }> = [];\n    const inFn = (list: ReadonlyArray<{ [key: string]: any }>, parent: T | null, deep: number = 0): void => {\n      for (const i of list) {\n        i[opt.deepMapName!] = deep;\n        i[opt.parentMapName!] = parent;\n        if (opt.cb) {\n          opt.cb(i, parent, deep);\n        }\n        result.push(i);\n        const children = i[opt.childrenMapName!];\n        if (children != null && Array.isArray(children) && children.length > 0) {\n          inFn(children, i as T, deep + 1);\n        }\n        if (opt.clearChildren) {\n          delete i[opt.childrenMapName!];\n        }\n      }\n    };\n    inFn(tree, null);\n    return result as T[];\n  }\n\n  /**\n   * Convert array structure to tree structure\n   *\n   * 数组转换成树数据\n   */\n  arrToTree<T extends object = any>(arr: readonly T[], options?: ArrayServiceArrToTreeOptions<T>): T[] {\n    if (!Array.isArray(arr) || arr.length === 0) {\n      return [];\n    }\n\n    const opt = {\n      idMapName: this.c.idMapName,\n      parentIdMapName: this.c.parentIdMapName,\n      childrenMapName: this.c.childrenMapName,\n      cb: null,\n      ...options\n    } as ArrayServiceArrToTreeOptions<T>;\n    const tree: T[] = [];\n    const childrenOf: { [key: string]: T[] } = {};\n    let rootPid = opt.rootParentIdValue;\n    const arrType = arr as ReadonlyArray<{ [key: string]: any }>;\n    if (!rootPid) {\n      const pids = arrType.map(i => i[opt.parentIdMapName!]);\n      const emptyPid = pids.findIndex(w => w == null);\n      rootPid = emptyPid !== -1 ? pids[emptyPid] : pids.sort()[0];\n    }\n    for (const item of arrType) {\n      const id = item[opt.idMapName!];\n      const pid = item[opt.parentIdMapName!];\n      childrenOf[id] = childrenOf[id] || [];\n      item[opt.childrenMapName!] = childrenOf[id];\n      if (opt.cb) {\n        opt.cb(item as T);\n      }\n      if (pid !== rootPid) {\n        childrenOf[pid] = childrenOf[pid] || [];\n        childrenOf[pid].push(item as T);\n      } else {\n        tree.push(item as T);\n      }\n    }\n    return tree;\n  }\n\n  /**\n   * 数组转换成 `nz-tree` 数据源，通过 `options` 转化项名，也可以使用 `options.cb` 更高级决定数据项\n   */\n  arrToTreeNode<T extends object = any>(arr: readonly T[], options?: ArrayServiceArrToTreeNodeOptions): NzTreeNode[] {\n    const opt = {\n      idMapName: this.c.idMapName,\n      parentIdMapName: this.c.parentIdMapName,\n      titleMapName: this.c.titleMapName,\n      isLeafMapName: 'isLeaf',\n      checkedMapname: this.c.checkedMapname,\n      selectedMapname: this.c.selectedMapname,\n      expandedMapname: this.c.expandedMapname,\n      disabledMapname: this.c.disabledMapname,\n      cb: null,\n      ...options\n    } as ArrayServiceArrToTreeNodeOptions<T>;\n    const tree = this.arrToTree<T>(arr, {\n      idMapName: opt.idMapName,\n      parentIdMapName: opt.parentIdMapName,\n      childrenMapName: 'children'\n    });\n    this.visitTree<T>(tree, (item: { [key: string]: any }, parent, deep) => {\n      item.key = item[opt.idMapName!];\n      item.title = item[opt.titleMapName!];\n      item.checked = item[opt.checkedMapname!];\n      item.selected = item[opt.selectedMapname!];\n      item.expanded = item[opt.expandedMapname!];\n      item.disabled = item[opt.disabledMapname!];\n      if (item[opt.isLeafMapName!] == null) {\n        item.isLeaf = item.children.length === 0;\n      } else {\n        item.isLeaf = item[opt.isLeafMapName!];\n      }\n      if (opt.cb) {\n        opt.cb(item as any, parent, deep);\n      }\n    });\n    return tree.map(node => new NzTreeNode(node as any));\n  }\n\n  /**\n   * 递归访问整个树\n   */\n  visitTree<T extends object = any>(\n    tree: readonly T[],\n    cb: (item: T, parent: T | null, deep: number) => void,\n    options?: {\n      /** 子项名，默认：`'children'` */\n      childrenMapName?: string;\n    }\n  ): void {\n    options = {\n      childrenMapName: this.c.childrenMapName,\n      ...options\n    };\n    const inFn = (data: readonly T[], parent: T | null, deep: number): void => {\n      for (const item of data) {\n        cb(item, parent, deep);\n        const childrenVal = (item as { [key: string]: any })[options!.childrenMapName!];\n        if (Array.isArray(childrenVal) && childrenVal.length > 0) {\n          inFn(childrenVal, item, deep + 1);\n        }\n      }\n    };\n    inFn(tree, null, 1);\n  }\n\n  /**\n   * Return the value of the first tree value in the tree where predicate is true, and `undefined` otherwise\n   *\n   * 根据条件返回树的第一个值，否则返回 `undefined`\n   */\n  findTree<T extends object = any>(\n    tree: readonly T[],\n    predicate: (item: T) => boolean,\n    options?: {\n      /** 子项名，默认：`'children'` */\n      childrenMapName?: string;\n    }\n  ): T | undefined {\n    let res: T | undefined;\n    this.visitTree<T>(\n      tree,\n      item => {\n        if (res === undefined && predicate(item)) {\n          res = item;\n        }\n      },\n      options\n    );\n    return res;\n  }\n\n  /**\n   * 获取所有已经选中的 `key` 值\n   */\n  getKeysByTreeNode(tree: NzTreeNode[], options?: ArrayServiceGetKeysByTreeNodeOptions): any[] {\n    const opt = {\n      includeHalfChecked: true,\n      ...options\n    } as ArrayServiceGetKeysByTreeNodeOptions;\n    const keys: any[] = [];\n    this.visitTree<NzTreeNode>(tree, (item, parent, deep) => {\n      if (item.isChecked || (opt.includeHalfChecked && item.isHalfChecked)) {\n        keys.push(opt.cb ? opt.cb(item, parent, deep) : opt.keyMapName ? item.origin[opt.keyMapName] : item.key);\n      }\n    });\n    return keys;\n  }\n  private baseFlat(array: any[], depth: number, result: any[] = []): any[] {\n    let index = -1;\n    while (++index < array.length) {\n      const value = array[index];\n      if (depth > 0 && Array.isArray(value)) {\n        if (depth > 1) {\n          this.baseFlat(value, depth - 1, result);\n        } else {\n          let pushIndex = -1;\n          const offset = result.length;\n\n          while (++pushIndex < value.length) {\n            result[offset + pushIndex] = value[pushIndex];\n          }\n        }\n      } else {\n        result[result.length] = value;\n      }\n    }\n    return result;\n  }\n  /**\n   * Recursively flattens array\n   *\n   * 递归扁平数组\n   * ```ts\n   * srv.flat([1, [2, 3, [4, 5, [6]]]]) => [1,2,3,4,5,6]\n   * srv.flat([1, [2, 3, [4, 5, [6]]]], 1) => [1,2,3,[4, 5, [6]]]\n   * ```\n   */\n  flat<T>(array: readonly T[], depth: number = 1 / 0): T[] {\n    return Array.isArray(array) ? this.baseFlat(array as any[], depth) : (array as T[]);\n  }\n  /**\n   * Group the array\n   *\n   * 对数组进行分组\n   * ```ts\n   * srv.groupBy([6.1, 4.2, 6.3], Math.floor) => {\"4\":[4.2],\"6\":[6.1,6.3]}\n   * srv.groupBy(['one', 'two', 'three'], v => v.length) => {\"3\":[\"one\",\"two\"],\"5\":[\"three\"]}\n   * ```\n   */\n  groupBy<T>(array: readonly T[], iteratee: (value: T) => string | number): ArrayServiceGroupByResult {\n    if (!Array.isArray(array)) {\n      return {};\n    }\n    return array.reduce((result, value) => {\n      const key = iteratee(value);\n      if (Object.prototype.hasOwnProperty.call(result, key)) {\n        result[key].push(value);\n      } else {\n        result[key] = [value];\n      }\n      return result;\n    }, {} as ArrayServiceGroupByResult);\n  }\n  /**\n   * Creates a duplicate-free version of an array\n   *\n   * 创建去重后的数组\n   * ```ts\n   * uniq([1, 2, 2, 3, 1]) => [1,2,3]\n   * uniq([{ a: 1 }, { a: 1 }, { a: 2 }], 'a') => [{\"a\":1},{\"a\":2}]\n   * uniq([{ a: 1 }, { a: 1 }, { a: 2 }], i => (i.a === 1 ? 'a' : 'b')) => [{\"a\":1},{\"a\":2}]\n   * ```\n   */\n  uniq<T>(array: readonly T[], predicate?: string | ((value: T) => string | number | boolean)): T[] {\n    return Array.from(\n      array\n        .reduce((map, value) => {\n          const key = predicate\n            ? typeof predicate === 'string'\n              ? (value as any)[predicate]\n              : predicate!(value)\n            : value;\n          if (!map.has(key)) {\n            map.set(key, value);\n          }\n          return map;\n        }, new Map<string | number | boolean, T>())\n        .values()\n    );\n  }\n}\n","/**\n * Generated bundle index. Do not edit.\n */\n\nexport * from './index';\n"],"names":[],"mappings":";;;;;AAAA;MAea,YAAY;IAGvB,YAAY,GAAwB;QAClC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE;YAC9B,WAAW,EAAE,MAAM;YACnB,aAAa,EAAE,QAAQ;YACvB,SAAS,EAAE,IAAI;YACf,eAAe,EAAE,WAAW;YAC5B,eAAe,EAAE,UAAU;YAC3B,YAAY,EAAE,OAAO;YACrB,cAAc,EAAE,SAAS;YACzB,eAAe,EAAE,UAAU;YAC3B,eAAe,EAAE,UAAU;YAC3B,eAAe,EAAE,UAAU;SAC5B,CAAE,CAAC;KACL;;;;;;IAOD,SAAS,CAAyB,IAAkB,EAAE,OAAyC;QAC7F,MAAM,GAAG,mBACP,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC,WAAW,EAC/B,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC,aAAa,EACnC,eAAe,EAAE,IAAI,CAAC,CAAC,CAAC,eAAe,EACvC,aAAa,EAAE,IAAI,EACnB,EAAE,EAAE,IAAI,IACL,OAAO,CACqB,CAAC;QAClC,MAAM,MAAM,GAAkC,EAAE,CAAC;QACjD,MAAM,IAAI,GAAG,CAAC,IAA2C,EAAE,MAAgB,EAAE,OAAe,CAAC;YAC3F,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;gBACpB,CAAC,CAAC,GAAG,CAAC,WAAY,CAAC,GAAG,IAAI,CAAC;gBAC3B,CAAC,CAAC,GAAG,CAAC,aAAc,CAAC,GAAG,MAAM,CAAC;gBAC/B,IAAI,GAAG,CAAC,EAAE,EAAE;oBACV,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;iBACzB;gBACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACf,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,eAAgB,CAAC,CAAC;gBACzC,IAAI,QAAQ,IAAI,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;oBACtE,IAAI,CAAC,QAAQ,EAAE,CAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;iBAClC;gBACD,IAAI,GAAG,CAAC,aAAa,EAAE;oBACrB,OAAO,CAAC,CAAC,GAAG,CAAC,eAAgB,CAAC,CAAC;iBAChC;aACF;SACF,CAAC;QACF,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjB,OAAO,MAAa,CAAC;KACtB;;;;;;IAOD,SAAS,CAAyB,GAAiB,EAAE,OAAyC;QAC5F,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;YAC3C,OAAO,EAAE,CAAC;SACX;QAED,MAAM,GAAG,mBACP,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,SAAS,EAC3B,eAAe,EAAE,IAAI,CAAC,CAAC,CAAC,eAAe,EACvC,eAAe,EAAE,IAAI,CAAC,CAAC,CAAC,eAAe,EACvC,EAAE,EAAE,IAAI,IACL,OAAO,CACwB,CAAC;QACrC,MAAM,IAAI,GAAQ,EAAE,CAAC;QACrB,MAAM,UAAU,GAA2B,EAAE,CAAC;QAC9C,IAAI,OAAO,GAAG,GAAG,CAAC,iBAAiB,CAAC;QACpC,MAAM,OAAO,GAAG,GAA4C,CAAC;QAC7D,IAAI,CAAC,OAAO,EAAE;YACZ,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,eAAgB,CAAC,CAAC,CAAC;YACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;YAChD,OAAO,GAAG,QAAQ,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;SAC7D;QACD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE;YAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,SAAU,CAAC,CAAC;YAChC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,eAAgB,CAAC,CAAC;YACvC,UAAU,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YACtC,IAAI,CAAC,GAAG,CAAC,eAAgB,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;YAC5C,IAAI,GAAG,CAAC,EAAE,EAAE;gBACV,GAAG,CAAC,EAAE,CAAC,IAAS,CAAC,CAAC;aACnB;YACD,IAAI,GAAG,KAAK,OAAO,EAAE;gBACnB,UAAU,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBACxC,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAS,CAAC,CAAC;aACjC;iBAAM;gBACL,IAAI,CAAC,IAAI,CAAC,IAAS,CAAC,CAAC;aACtB;SACF;QACD,OAAO,IAAI,CAAC;KACb;;;;IAKD,aAAa,CAAyB,GAAiB,EAAE,OAA0C;QACjG,MAAM,GAAG,mBACP,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,SAAS,EAC3B,eAAe,EAAE,IAAI,CAAC,CAAC,CAAC,eAAe,EACvC,YAAY,EAAE,IAAI,CAAC,CAAC,CAAC,YAAY,EACjC,aAAa,EAAE,QAAQ,EACvB,cAAc,EAAE,IAAI,CAAC,CAAC,CAAC,cAAc,EACrC,eAAe,EAAE,IAAI,CAAC,CAAC,CAAC,eAAe,EACvC,eAAe,EAAE,IAAI,CAAC,CAAC,CAAC,eAAe,EACvC,eAAe,EAAE,IAAI,CAAC,CAAC,CAAC,eAAe,EACvC,EAAE,EAAE,IAAI,IACL,OAAO,CAC4B,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAI,GAAG,EAAE;YAClC,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,eAAe,EAAE,GAAG,CAAC,eAAe;YACpC,eAAe,EAAE,UAAU;SAC5B,CAAC,CAAC;QACH,IAAI,CAAC,SAAS,CAAI,IAAI,EAAE,CAAC,IAA4B,EAAE,MAAM,EAAE,IAAI;YACjE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,SAAU,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,YAAa,CAAC,CAAC;YACrC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,cAAe,CAAC,CAAC;YACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,eAAgB,CAAC,CAAC;YAC3C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,eAAgB,CAAC,CAAC;YAC3C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,eAAgB,CAAC,CAAC;YAC3C,IAAI,IAAI,CAAC,GAAG,CAAC,aAAc,CAAC,IAAI,IAAI,EAAE;gBACpC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;aAC1C;iBAAM;gBACL,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,aAAc,CAAC,CAAC;aACxC;YACD,IAAI,GAAG,CAAC,EAAE,EAAE;gBACV,GAAG,CAAC,EAAE,CAAC,IAAW,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;aACnC;SACF,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,UAAU,CAAC,IAAW,CAAC,CAAC,CAAC;KACtD;;;;IAKD,SAAS,CACP,IAAkB,EAClB,EAAqD,EACrD,OAGC;QAED,OAAO,mBACL,eAAe,EAAE,IAAI,CAAC,CAAC,CAAC,eAAe,IACpC,OAAO,CACX,CAAC;QACF,MAAM,IAAI,GAAG,CAAC,IAAkB,EAAE,MAAgB,EAAE,IAAY;YAC9D,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;gBACvB,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;gBACvB,MAAM,WAAW,GAAI,IAA+B,CAAC,OAAQ,CAAC,eAAgB,CAAC,CAAC;gBAChF,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;oBACxD,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;iBACnC;aACF;SACF,CAAC;QACF,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;KACrB;;;;;;IAOD,QAAQ,CACN,IAAkB,EAClB,SAA+B,EAC/B,OAGC;QAED,IAAI,GAAkB,CAAC;QACvB,IAAI,CAAC,SAAS,CACZ,IAAI,EACJ,IAAI;YACF,IAAI,GAAG,KAAK,SAAS,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE;gBACxC,GAAG,GAAG,IAAI,CAAC;aACZ;SACF,EACD,OAAO,CACR,CAAC;QACF,OAAO,GAAG,CAAC;KACZ;;;;IAKD,iBAAiB,CAAC,IAAkB,EAAE,OAA8C;QAClF,MAAM,GAAG,mBACP,kBAAkB,EAAE,IAAI,IACrB,OAAO,CAC6B,CAAC;QAC1C,MAAM,IAAI,GAAU,EAAE,CAAC;QACvB,IAAI,CAAC,SAAS,CAAa,IAAI,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI;YAClD,IAAI,IAAI,CAAC,SAAS,KAAK,GAAG,CAAC,kBAAkB,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE;gBACpE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;aAC1G;SACF,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;KACb;IACO,QAAQ,CAAC,KAAY,EAAE,KAAa,EAAE,SAAgB,EAAE;QAC9D,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;QACf,OAAO,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE;YAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAC3B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;gBACrC,IAAI,KAAK,GAAG,CAAC,EAAE;oBACb,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;iBACzC;qBAAM;oBACL,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;oBACnB,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;oBAE7B,OAAO,EAAE,SAAS,GAAG,KAAK,CAAC,MAAM,EAAE;wBACjC,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;qBAC/C;iBACF;aACF;iBAAM;gBACL,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;aAC/B;SACF;QACD,OAAO,MAAM,CAAC;KACf;;;;;;;;;;IAUD,IAAI,CAAI,KAAmB,EAAE,QAAgB,CAAC,GAAG,CAAC;QAChD,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAc,EAAE,KAAK,CAAC,GAAI,KAAa,CAAC;KACrF;;;;;;;;;;IAUD,OAAO,CAAI,KAAmB,EAAE,QAAuC;QACrE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;YACzB,OAAO,EAAE,CAAC;SACX;QACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,KAAK;YAChC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;gBACrD,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACzB;iBAAM;gBACL,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;aACvB;YACD,OAAO,MAAM,CAAC;SACf,EAAE,EAA+B,CAAC,CAAC;KACrC;;;;;;;;;;;IAWD,IAAI,CAAI,KAAmB,EAAE,SAA8D;QACzF,OAAO,KAAK,CAAC,IAAI,CACf,KAAK;aACF,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK;YACjB,MAAM,GAAG,GAAG,SAAS;kBACjB,OAAO,SAAS,KAAK,QAAQ;sBAC1B,KAAa,CAAC,SAAS,CAAC;sBACzB,SAAU,CAAC,KAAK,CAAC;kBACnB,KAAK,CAAC;YACV,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;gBACjB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;aACrB;YACD,OAAO,GAAG,CAAC;SACZ,EAAE,IAAI,GAAG,EAAgC,CAAC;aAC1C,MAAM,EAAE,CACZ,CAAC;KACH;;yGAjSU,YAAY;6GAAZ,YAAY,cADC,MAAM;2FACnB,YAAY;kBADxB,UAAU;mBAAC,EAAE,UAAU,EAAE,MAAM,EAAE;;;ACdlC;;;;;;"}