util-helpers 4.14.1 → 4.15.0

package/README.md

@@ -53,6 +53,7 @@ formatBankCard('6228480402564890018', { spaceMark: '-' }); // 6228-4804-0256-489
   - [blobToDataURL](https://doly-dev.github.io/util-helpers/module-Processor.html#.blobToDataURL) - 将 Blob 或 File 对象转成 data:URL 格式的 Base64 字符串
   - [bytesToSize](https://doly-dev.github.io/util-helpers/module-Processor.html#.bytesToSize) - 字节转换为存储单位
   - [dataURLToBlob](https://doly-dev.github.io/util-helpers/module-Processor.html#.dataURLToBlob) - 将 DataURL 转为 Blob 对象
+  - [filterTree](https://doly-dev.github.io/util-helpers/module-Processor.html#.filterTree) - 过滤树节点
   - [formatMoney](https://doly-dev.github.io/util-helpers/module-Processor.html#.formatMoney) - 格式化金额
   - [formatMobile](https://doly-dev.github.io/util-helpers/module-Processor.html#.formatMobile) - 格式化手机号码
   - [formatBankCard](https://doly-dev.github.io/util-helpers/module-Processor.html#.formatBankCard) - 格式化银行卡
@@ -92,6 +93,7 @@ formatBankCard('6228480402564890018', { spaceMark: '-' }); // 6228-4804-0256-489
 - 其他
   - [calculateCursorPosition](https://doly-dev.github.io/util-helpers/module-Other.html#.calculateCursorPosition) - 计算光标位置
   - [findTreeNode](https://doly-dev.github.io/util-helpers/module-Other.html#.findTreeNode) - 查找树结构数据节点
+  - [findTreeNodes](https://doly-dev.github.io/util-helpers/module-Other.html#.findTreeNodes) - 查找树结构数据多个节点
   - [findTreeSelect](https://doly-dev.github.io/util-helpers/module-Other.html#.findTreeSelect) - 查找包含当前节点的所有父级节点
   - [randomString](https://doly-dev.github.io/util-helpers/module-Other.html#.randomString) - 随机字符串
   - [strlen](https://doly-dev.github.io/util-helpers/module-Other.html#.strlen) - 字符长度
@@ -103,13 +105,15 @@ formatBankCard('6228480402564890018', { spaceMark: '-' }); // 6228-4804-0256-489
 - [query-string] - URL 解析、序列化
 - [qs] - URL 查询字符串解析和序列化库
 - [js-cookie] - 一个简单，轻量级的 JavaScript API，用于处理 cookie
-- [moment] - 一个轻量级 JavaScript 日期库，用于解析，验证，操作和格式化日期
+- [store2] - 丰富了 localStorage 和 sessionStorage 功能（JSON，命名空间，扩展等）
 - [dayjs] - 一个轻量的处理时间和日期的 JavaScript 库，和 Moment.js 的 API 设计保持完全一样
+- [date-fns] - 提供了最全面、简单且一致的工具集，用于在浏览器和 Node.js 中操作 JavaScript 日期
+- [moment] - 一个轻量级 JavaScript 日期库，用于解析，验证，操作和格式化日期
+- [ms] - 将各种时间格式转换为毫秒
 - [axios] - 基于 Promise 的 HTTP 客户端，用于浏览器和 node.js
 - [jsencrypt] - 用于执行 OpenSSL RSA 加密，解密和密钥生成的 Javascript 库
 - [crypto-js] - 加密标准的 JavaScript 库
 - [tinycolor2] - JavaScript 颜色工具，用于 JavaScript 中的颜色处理和转换
-- [store2] - 丰富了 localStorage 和 sessionStorage 功能（JSON，命名空间，扩展等）
 - [uuid] - 生成通用唯一识别码（Universally Unique Identifier）
 - [JSZip] - 创建、读取和编辑 zip 文件
 - [ua-parser-js] - 用于从用户代理数据中检测浏览器、引擎、操作系统、CPU 和设备类型/型号
@@ -120,6 +124,8 @@ formatBankCard('6228480402564890018', { spaceMark: '-' }); // 6228-4804-0256-489
 [js-cookie]: https://www.npmjs.com/package/js-cookie
 [moment]: https://www.npmjs.com/package/moment
 [dayjs]: https://www.npmjs.com/package/dayjs
+[date-fns]: https://www.npmjs.com/package/date-fns
+[ms]: https://www.npmjs.com/package/ms
 [axios]: https://www.npmjs.com/package/axios
 [jsencrypt]: https://www.npmjs.com/package/jsencrypt
 [crypto-js]: https://www.npmjs.com/package/crypto-js

package/dist/util-helpers.js

@@ -537,7 +537,7 @@
   }
 
   // eslint-disable-next-line no-undef
-  var version = "4.14.1";
+  var version = "4.15.0";
 
   /**
    * 打印警告信息
@@ -2704,9 +2704,9 @@
    * @template {*} D
    * @template {Record<string, keyof D>} F
    * @template {string} C
-   * @param {D[]} data 对象数组。如果是树结构数据，需要指定第三个参数 childrenFieldName
+   * @param {D[]} data 对象数组。如果是树结构数据，需要指定第三个参数 childrenField
    * @param {F} fieldNames 字段名映射
-   * @param {C} [childrenFieldName] 子级数据字段名
+   * @param {C} [childrenField] 子级数据字段名
    * @param {'spread'|'self'} [nodeAssign='spread'] 节点赋值方式。spread表示使用展开运算符创建新值，self表示使用自身对象。
    * @returns {import('./transformFieldNames.type.js').TransformFieldNames<D, F, C>}
    * @example
@@ -2728,7 +2728,7 @@
    * const newOptions4 = transformFieldNames(options3, {label: 'name', value: 'code', children: 'childs'}, 'childs');
    * // [{value: '1', label: 'one'},{value:'2', label:'two', children: [{value: '2-1', label:'two-one'}]}]
    */
-  function transformFieldNames(data, fieldNames, childrenFieldName) {
+  function transformFieldNames(data, fieldNames, childrenField) {
     var nodeAssign = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 'spread';
     if (!Array.isArray(data)) {
       return data;
@@ -2756,9 +2756,9 @@
 
         // 树形数据子节点
         // @ts-ignore
-        if (childrenFieldName && Array.isArray(newItem[childrenFieldName]) && newItem[childrenFieldName].length > 0) {
+        if (childrenField && Array.isArray(newItem[childrenField]) && newItem[childrenField].length > 0) {
           // @ts-ignore
-          newItem[childrenFieldName] = recusion(newItem[childrenFieldName].slice());
+          newItem[childrenField] = recusion(newItem[childrenField].slice());
         }
 
         // 替换字段名
@@ -2956,140 +2956,60 @@
   }
 
   /**
-   * 查找树结构数据节点
+   * 过滤/筛选树节点。<br/><br/>如果某节点被过滤掉，它的子节点也一并抛弃
    * 
    * @static
-   * @alias module:Other.findTreeNode
-   * @since 4.14.0
+   * @alias module:Processor.filterTree
+   * @since 4.15.0
    * @template {any} T
    * @template {(item: T) => boolean} F
    * @param {T[]} tree 树结构数据
-   * @param {F} predicate 遍历每一项执行的函数，参数是当前遍历到的节点数据，如果返回 Truthy 将返回该节点
+   * @param {F} predicate 遍历每一项执行的函数，参数是当前遍历到的节点数据，如果返回 Truthy ，结果将包含该节点
    * @param {string} [childrenField='children'] 子级字段名
-   * @returns {T|undefined}
+   * @param {'spread'|'self'} [nodeAssign='spread'] 节点赋值方式。spread表示使用展开运算符创建新值，self表示使用自身对象。
+   * @returns {T[]}
    * @example
    * const menus = [{ "id": "1", "name": "首页", "code": "trade", "pid": null }, { "id": "2", "name": "交易管理", "code": "trade", "pid": null, "children": [{ "id": "3", "name": "交易查询", "code": "trade-1", "pid": "2", "children": [{ "id": "4", "name": "交易查询-查询操作", "code": "trade-1-1", "pid": "3" }] }] }, { "id": "5", "name": "权限管理", "code": "authorization", "pid": null, "children": [{ "id": "6", "name": "角色管理", "code": "authorization-1", "pid": "5" }, { "id": "7", "name": "用户管理", "code": "authorization-2", "pid": "5" }] }];
    * 
-   * findTreeNode(menus, item=>item.id === '2');
-   * // {"id":"2","name":"交易管理","code":"trade","pid":null,"children":[{"id":"3","name":"交易查询","code":"trade-1","pid":"2","children":[{"id":"4","name":"交易查询-查询操作","code":"trade-1-1","pid":"3"}]}]}
+   * filterTree(menus, item=>item.name.indexOf('管理') > -1);
+   * // [{"id":"2","name":"交易管理","code":"trade","pid":null,"children":[]},{"id":"5","name":"权限管理","code":"authorization","pid":null,"children":[{"id":"6","name":"角色管理","code":"authorization-1","pid":"5"},{"id":"7","name":"用户管理","code":"authorization-2","pid":"5"}]}]
    * 
-   * findTreeNode(menus, item=>item.id === '7');
-   * // {"id":"7","name":"用户管理","code":"authorization-2","pid":"5"}
-   * 
-   * findTreeNode(menus, item=>item.id === 'not found');
-   * // undefined
-   */
-  function findTreeNode(tree, predicate) {
-    var childrenField = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'children';
-    var stack = [];
-
-    /** @type {T|undefined} */
-    var node;
-    var _iterator = _createForOfIteratorHelper(tree),
-      _step;
-    try {
-      for (_iterator.s(); !(_step = _iterator.n()).done;) {
-        var item = _step.value;
-        stack.push(item);
-        while (stack.length) {
-          /** @type {T} */
-          // @ts-ignore
-          var temp = stack.pop();
-          if (predicate(temp)) {
-            node = temp;
-            break;
-          }
-
-          /** @type {T[]} */
-          // @ts-ignore
-          var children = temp[childrenField] || [];
-          stack.push.apply(stack, _toConsumableArray(children));
-        }
-        if (node) {
-          break;
-        }
-      }
-    } catch (err) {
-      _iterator.e(err);
-    } finally {
-      _iterator.f();
-    }
-    return node;
-  }
-
-  /**
-   * 内部实现
+   * // 如果某节点被过滤掉，它的子节点也一并抛弃
+   * filterTree(menus, item=>item.id === '7');
+   * // []
    * 
-   * @private
-   * @template {any} T
-   * @template {(item: T) => boolean} F
-   * @param {T[]} tree 树结构数据
-   * @param {F} predicate 遍历每一项执行的函数，参数是当前遍历到的节点数据，如果返回 Truthy 将返回包含该节点的所有父级节点
-   * @param {string} [childrenField='children'] 子级字段名
-   * @param {T[]} [path=[]] 当前遍历路径
-   * @returns {T[]}
+   * filterTree(menus, item=>item.id === 'not found');
+   * // []
    */
-  function internalFindTreeSelect(tree, predicate) {
+  function filterTree(tree, predicate) {
     var childrenField = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'children';
-    var path = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
-    if (!tree) {
-      return [];
+    var nodeAssign = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 'spread';
+    if (!Array.isArray(tree)) {
+      return tree;
     }
-    var _iterator = _createForOfIteratorHelper(tree),
-      _step;
-    try {
-      for (_iterator.s(); !(_step = _iterator.n()).done;) {
-        var item = _step.value;
-        path.push(item);
-        if (predicate(item)) {
-          return path;
-        }
 
+    /** @type {T[]} */
+    var result = [];
+    tree.forEach(function (item) {
+      var newItem = item;
+      if (isObject(item)) {
         // @ts-ignore
-        if (isObject(item) && Array.isArray(item[childrenField]) && item[childrenField].length > 0) {
+        newItem = nodeAssign === 'spread' ? _objectSpread2({}, item) : item;
+      }
+      if (predicate(newItem)) {
+        if (isObject(newItem)) {
+          /** @type {T[]|undefined} */
           // @ts-ignore
-          var findChildren = internalFindTreeSelect(item[childrenField], predicate, childrenField, path);
-          if (findChildren.length > 0) {
-            return findChildren;
+          var childs = newItem[childrenField];
+          if (Array.isArray(childs) && childs.length > 0) {
+            // @ts-ignore
+            newItem[childrenField] = filterTree(childs, predicate, childrenField, nodeAssign);
           }
         }
-        path.pop();
+        result.push(newItem);
       }
-    } catch (err) {
-      _iterator.e(err);
-    } finally {
-      _iterator.f();
-    }
-    return [];
-  }
-
-  /**
-   * 查找包含当前节点的所有父级节点
-   * 
-   * @static
-   * @alias module:Other.findTreeSelect
-   * @since 4.14.0
-   * @template {any} T
-   * @template {(item: T) => boolean} F
-   * @param {T[]} tree 树结构数据
-   * @param {F} predicate 遍历每一项执行的函数，参数是当前遍历到的节点数据，如果返回 Truthy 将返回包含该节点的所有父级节点
-   * @param {string} [childrenField='children'] 子级字段名
-   * @returns {T[]}
-   * @example
-   * const menus = [{ "id": "1", "name": "首页", "code": "trade", "pid": null }, { "id": "2", "name": "交易管理", "code": "trade", "pid": null, "children": [{ "id": "3", "name": "交易查询", "code": "trade-1", "pid": "2", "children": [{ "id": "4", "name": "交易查询-查询操作", "code": "trade-1-1", "pid": "3" }] }] }, { "id": "5", "name": "权限管理", "code": "authorization", "pid": null, "children": [{ "id": "6", "name": "角色管理", "code": "authorization-1", "pid": "5" }, { "id": "7", "name": "用户管理", "code": "authorization-2", "pid": "5" }] }];
-   * 
-   * findTreeSelect(menus, item => item.id === '2');
-   * // [{"id":"2","name":"交易管理","code":"trade","pid":null,"children":[{"id":"3","name":"交易查询","code":"trade-1","pid":"2","children":[{"id":"4","name":"交易查询-查询操作","code":"trade-1-1","pid":"3"}]}]}]
-   * 
-   * findTreeSelect(menus, item => item.id === '7');
-   * // [{"id":"5","name":"权限管理","code":"authorization","pid":null,"children":[{"id":"6","name":"角色管理","code":"authorization-1","pid":"5"},{"id":"7","name":"用户管理","code":"authorization-2","pid":"5"}]},{"id":"7","name":"用户管理","code":"authorization-2","pid":"5"}]
-   * 
-   * findTreeSelect(menus, item => item.id === 'not found');
-   * // []
-   */
-  function findTreeSelect(tree, predicate) {
-    var childrenField = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'children';
-    return internalFindTreeSelect(tree, predicate, childrenField);
+    });
+    return result;
   }
 
   /**
@@ -3313,7 +3233,7 @@
     });
   }
 
-  // 参考了: https://github.com/ant-design/ant-design-mobile/blob/v2/components/input-item/index.tsx#L240
+  // ref: https://github.com/ant-design/ant-design-mobile/blob/v2/components/input-item/index.tsx#L240
 
   /**
    * 计算输入框的值格式化后光标位置
@@ -3321,8 +3241,6 @@
    * @static
    * @alias module:Other.calculateCursorPosition
    * @since 4.6.0
-   * @see 格式化手机号码 {@link https://doly-dev.github.io/util-helpers/module-Processor.html#.formatMobile|formatMobile}
-   * @see 格式化银行卡号 {@link https://doly-dev.github.io/util-helpers/module-Processor.html#.formatBankCard|formatBankCard}
    * @see h5示例 {@link https://2950v9.csb.app/|点击查看}
    * @see react示例 {@link https://33ccy9.csb.app/|点击查看}
    * @param {number} prevPos 赋值前的光标位置，onChange/onInput的光标位置 e.target.selectionEnd
@@ -3448,12 +3366,220 @@
     return len;
   }
 
+  /**
+   * 查找树结构数据节点
+   * 
+   * @static
+   * @alias module:Other.findTreeNode
+   * @since 4.14.0
+   * @template {any} T
+   * @template {(item: T) => boolean} F
+   * @param {T[]} tree 树结构数据
+   * @param {F} predicate 遍历每一项执行的函数，参数是当前遍历到的节点数据，如果返回 Truthy ，将返回该节点
+   * @param {string} [childrenField='children'] 子级字段名
+   * @returns {T|undefined}
+   * @example
+   * const menus = [{ "id": "1", "name": "首页", "code": "trade", "pid": null }, { "id": "2", "name": "交易管理", "code": "trade", "pid": null, "children": [{ "id": "3", "name": "交易查询", "code": "trade-1", "pid": "2", "children": [{ "id": "4", "name": "交易查询-查询操作", "code": "trade-1-1", "pid": "3" }] }] }, { "id": "5", "name": "权限管理", "code": "authorization", "pid": null, "children": [{ "id": "6", "name": "角色管理", "code": "authorization-1", "pid": "5" }, { "id": "7", "name": "用户管理", "code": "authorization-2", "pid": "5" }] }];
+   * 
+   * findTreeNode(menus, item=>item.id === '2');
+   * // {"id":"2","name":"交易管理","code":"trade","pid":null,"children":[{"id":"3","name":"交易查询","code":"trade-1","pid":"2","children":[{"id":"4","name":"交易查询-查询操作","code":"trade-1-1","pid":"3"}]}]}
+   * 
+   * findTreeNode(menus, item=>item.id === '7');
+   * // {"id":"7","name":"用户管理","code":"authorization-2","pid":"5"}
+   * 
+   * findTreeNode(menus, item=>item.id === 'not found');
+   * // undefined
+   */
+  function findTreeNode(tree, predicate) {
+    var childrenField = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'children';
+    var stack = [];
+
+    /** @type {T|undefined} */
+    var node;
+    var _iterator = _createForOfIteratorHelper(tree),
+      _step;
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var item = _step.value;
+        stack.push(item);
+        while (stack.length) {
+          /** @type {T} */
+          // @ts-ignore
+          var temp = stack.pop();
+          if (predicate(temp)) {
+            node = temp;
+            break;
+          }
+          if (isObject(temp)) {
+            /** @type {T[]} */
+            // @ts-ignore
+            var childs = temp[childrenField];
+            if (Array.isArray(childs) && childs.length > 0) {
+              stack.push.apply(stack, _toConsumableArray(childs));
+            }
+          }
+        }
+        if (node) {
+          break;
+        }
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+    return node;
+  }
+
+  /**
+   * 查找树结构数据多个节点
+   * 
+   * @static
+   * @alias module:Other.findTreeNodes
+   * @since 4.15.0
+   * @template {any} T
+   * @template {(item: T) => boolean} F
+   * @param {T[]} tree 树结构数据
+   * @param {F} predicate 遍历每一项执行的函数，参数是当前遍历到的节点数据，如果返回 Truthy ，返回结果将包含该节点
+   * @param {string} [childrenField='children'] 子级字段名
+   * @returns {T[]}
+   * @example
+   * const menus = [{ "id": "1", "name": "首页", "code": "trade", "pid": null }, { "id": "2", "name": "交易管理", "code": "trade", "pid": null, "children": [{ "id": "3", "name": "交易查询", "code": "trade-1", "pid": "2", "children": [{ "id": "4", "name": "交易查询-查询操作", "code": "trade-1-1", "pid": "3" }] }] }, { "id": "5", "name": "权限管理", "code": "authorization", "pid": null, "children": [{ "id": "6", "name": "角色管理", "code": "authorization-1", "pid": "5" }, { "id": "7", "name": "用户管理", "code": "authorization-2", "pid": "5" }] }];
+   * 
+   * findTreeNodes(menus, item=>item.id === '2');
+   * // [{"id":"2","name":"交易管理","code":"trade","pid":null,"children":[{"id":"3","name":"交易查询","code":"trade-1","pid":"2","children":[{"id":"4","name":"交易查询-查询操作","code":"trade-1-1","pid":"3"}]}]}]
+   * 
+   * findTreeNodes(menus, item=>item.name.indexOf('管理') > -1);
+   * // [{"id":"2","name":"交易管理","code":"trade","pid":null,"children":[{"id":"3","name":"交易查询","code":"trade-1","pid":"2","children":[{"id":"4","name":"交易查询-查询操作","code":"trade-1-1","pid":"3"}]}]},{"id":"5","name":"权限管理","code":"authorization","pid":null,"children":[{"id":"6","name":"角色管理","code":"authorization-1","pid":"5"},{"id":"7","name":"用户管理","code":"authorization-2","pid":"5"}]},{"id":"7","name":"用户管理","code":"authorization-2","pid":"5"},{"id":"6","name":"角色管理","code":"authorization-1","pid":"5"}]
+   * 
+   * findTreeNodes(menus, item=>item.id === '1' || item.id === '7');
+   * // [{"id":"1","name":"首页","code":"trade","pid":null},{"id":"7","name":"用户管理","code":"authorization-2","pid":"5"}]
+   * 
+   * findTreeNodes(menus, item=>item.id === 'not found');
+   * // []
+   */
+  function findTreeNodes(tree, predicate) {
+    var childrenField = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'children';
+    var stack = [];
+
+    /** @type {T[]} */
+    var nodes = [];
+    var _iterator = _createForOfIteratorHelper(tree),
+      _step;
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var item = _step.value;
+        stack.push(item);
+        while (stack.length) {
+          /** @type {T} */
+          // @ts-ignore
+          var temp = stack.pop();
+          if (predicate(temp)) {
+            nodes.push(temp);
+          }
+          if (isObject(temp)) {
+            /** @type {T[]} */
+            // @ts-ignore
+            var childs = temp[childrenField];
+            if (Array.isArray(childs) && childs.length > 0) {
+              stack.push.apply(stack, _toConsumableArray(childs));
+            }
+          }
+        }
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+    return nodes;
+  }
+
+  /**
+   * 内部实现
+   * 
+   * @private
+   * @template {any} T
+   * @template {(item: T) => boolean} F
+   * @param {T[]} tree 树结构数据
+   * @param {F} predicate 遍历每一项执行的函数，参数是当前遍历到的节点数据，如果返回 Truthy 将返回包含该节点的所有父级节点
+   * @param {string} [childrenField='children'] 子级字段名
+   * @param {T[]} [path=[]] 当前遍历路径
+   * @returns {T[]}
+   */
+  function internalFindTreeSelect(tree, predicate) {
+    var childrenField = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'children';
+    var path = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
+    if (!tree) {
+      return [];
+    }
+    var _iterator = _createForOfIteratorHelper(tree),
+      _step;
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var item = _step.value;
+        path.push(item);
+        if (predicate(item)) {
+          return path;
+        }
+        if (isObject(item)) {
+          /** @type {T[]} */
+          // @ts-ignore
+          var childs = item[childrenField];
+          if (Array.isArray(childs) && childs.length > 0) {
+            var findChildren = internalFindTreeSelect(childs, predicate, childrenField, path);
+            if (findChildren.length > 0) {
+              return findChildren;
+            }
+          }
+        }
+        path.pop();
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+    return [];
+  }
+
+  /**
+   * 查找包含当前节点的所有父级节点
+   * 
+   * @static
+   * @alias module:Other.findTreeSelect
+   * @since 4.14.0
+   * @template {any} T
+   * @template {(item: T) => boolean} F
+   * @param {T[]} tree 树结构数据
+   * @param {F} predicate 遍历每一项执行的函数，参数是当前遍历到的节点数据，如果返回 Truthy 将返回包含该节点的所有父级节点
+   * @param {string} [childrenField='children'] 子级字段名
+   * @returns {T[]}
+   * @example
+   * const menus = [{ "id": "1", "name": "首页", "code": "trade", "pid": null }, { "id": "2", "name": "交易管理", "code": "trade", "pid": null, "children": [{ "id": "3", "name": "交易查询", "code": "trade-1", "pid": "2", "children": [{ "id": "4", "name": "交易查询-查询操作", "code": "trade-1-1", "pid": "3" }] }] }, { "id": "5", "name": "权限管理", "code": "authorization", "pid": null, "children": [{ "id": "6", "name": "角色管理", "code": "authorization-1", "pid": "5" }, { "id": "7", "name": "用户管理", "code": "authorization-2", "pid": "5" }] }];
+   * 
+   * findTreeSelect(menus, item => item.id === '2');
+   * // [{"id":"2","name":"交易管理","code":"trade","pid":null,"children":[{"id":"3","name":"交易查询","code":"trade-1","pid":"2","children":[{"id":"4","name":"交易查询-查询操作","code":"trade-1-1","pid":"3"}]}]}]
+   * 
+   * findTreeSelect(menus, item => item.id === '7');
+   * // [{"id":"5","name":"权限管理","code":"authorization","pid":null,"children":[{"id":"6","name":"角色管理","code":"authorization-1","pid":"5"},{"id":"7","name":"用户管理","code":"authorization-2","pid":"5"}]},{"id":"7","name":"用户管理","code":"authorization-2","pid":"5"}]
+   * 
+   * findTreeSelect(menus, item => item.id === 'not found');
+   * // []
+   */
+  function findTreeSelect(tree, predicate) {
+    var childrenField = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'children';
+    return internalFindTreeSelect(tree, predicate, childrenField);
+  }
+
   exports.blobToDataURL = blobToDataURL;
   exports.bytesToSize = bytesToSize;
   exports.calculateCursorPosition = calculateCursorPosition;
   exports.dataURLToBlob = dataURLToBlob;
   exports.divide = divide;
+  exports.filterTree = filterTree;
   exports.findTreeNode = findTreeNode;
+  exports.findTreeNodes = findTreeNodes;
   exports.findTreeSelect = findTreeSelect;
   exports.formatBankCard = formatBankCard;
   exports.formatMobile = formatMobile;