util-helpers 4.14.0 → 4.15.0

package/esm/calculateCursorPosition.js

@@ -1,6 +1,6 @@
 import normalizeString from './normalizeString';
 
-// 参考了: 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
 
 /**
  * 计算输入框的值格式化后光标位置
@@ -8,8 +8,6 @@ import normalizeString from './normalizeString';
  * @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

package/esm/filterTree.js

@@ -0,0 +1,62 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+import { isObject } from "./utils/type";
+
+/**
+ * 过滤/筛选树节点。<br/><br/>如果某节点被过滤掉，它的子节点也一并抛弃
+ * 
+ * @static
+ * @alias module:Processor.filterTree
+ * @since 4.15.0
+ * @template {any} T
+ * @template {(item: T) => boolean} F
+ * @param {T[]} tree 树结构数据
+ * @param {F} predicate 遍历每一项执行的函数，参数是当前遍历到的节点数据，如果返回 Truthy ，结果将包含该节点
+ * @param {string} [childrenField='children'] 子级字段名
+ * @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" }] }];
+ * 
+ * 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"}]}]
+ * 
+ * // 如果某节点被过滤掉，它的子节点也一并抛弃
+ * filterTree(menus, item=>item.id === '7');
+ * // []
+ * 
+ * filterTree(menus, item=>item.id === 'not found');
+ * // []
+ */
+function filterTree(tree, predicate) {
+  var childrenField = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'children';
+  var nodeAssign = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 'spread';
+  if (!Array.isArray(tree)) {
+    return tree;
+  }
+
+  /** @type {T[]} */
+  var result = [];
+  tree.forEach(function (item) {
+    var newItem = item;
+    if (isObject(item)) {
+      // @ts-ignore
+      newItem = nodeAssign === 'spread' ? _objectSpread({}, item) : item;
+    }
+    if (predicate(newItem)) {
+      if (isObject(newItem)) {
+        /** @type {T[]|undefined} */
+        // @ts-ignore
+        var childs = newItem[childrenField];
+        if (Array.isArray(childs) && childs.length > 0) {
+          // @ts-ignore
+          newItem[childrenField] = filterTree(childs, predicate, childrenField, nodeAssign);
+        }
+      }
+      result.push(newItem);
+    }
+  });
+  return result;
+}
+export default filterTree;

package/esm/findTreeNode.js

@@ -2,6 +2,8 @@ import _toConsumableArray from "@babel/runtime/helpers/toConsumableArray";
 function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
 function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
 function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+import { isObject } from "./utils/type";
+
 /**
  * 查找树结构数据节点
  * 
@@ -11,7 +13,7 @@ function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len
  * @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}
  * @example
@@ -46,11 +48,14 @@ function findTreeNode(tree, predicate) {
           node = temp;
           break;
         }
-
-        /** @type {T[]} */
-        // @ts-ignore
-        var children = temp[childrenField] || [];
-        stack.push.apply(stack, _toConsumableArray(children));
+        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;

package/esm/findTreeNodes.js

@@ -0,0 +1,70 @@
+import _toConsumableArray from "@babel/runtime/helpers/toConsumableArray";
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+import { isObject } from "./utils/type";
+
+/**
+ * 查找树结构数据多个节点
+ * 
+ * @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;
+}
+export default findTreeNodes;

package/esm/findTreeSelect.js

@@ -30,13 +30,15 @@ function internalFindTreeSelect(tree, predicate) {
       if (predicate(item)) {
         return path;
       }
-
-      // @ts-ignore
-      if (isObject(item) && Array.isArray(item[childrenField]) && item[childrenField].length > 0) {
+      if (isObject(item)) {
+        /** @type {T[]} */
         // @ts-ignore
-        var findChildren = internalFindTreeSelect(item[childrenField], predicate, childrenField, path);
-        if (findChildren.length > 0) {
-          return findChildren;
+        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();

package/esm/index.js

@@ -49,8 +49,7 @@ export { default as padZero } from './padZero';
 export { default as transformFieldNames } from './transformFieldNames';
 export { default as listToTree } from './listToTree';
 export { default as treeToList } from './treeToList';
-export { default as findTreeNode } from './findTreeNode';
-export { default as findTreeSelect } from './findTreeSelect';
+export { default as filterTree } from './filterTree';
 
 /**
  * 数学计算，修正浮点数计算问题
@@ -107,6 +106,9 @@ export { default as waitTime } from './waitTime';
 export { default as calculateCursorPosition } from './calculateCursorPosition';
 export { default as randomString } from './randomString';
 export { default as strlen } from './strlen';
+export { default as findTreeNode } from './findTreeNode';
+export { default as findTreeNodes } from './findTreeNodes';
+export { default as findTreeSelect } from './findTreeSelect';
 
 /**
  * 调试相关

package/esm/listToTree.js

@@ -49,6 +49,7 @@ function processEmptyChildren(arr) {
  * @param {string} [options.parentField='pid'] 当前数据的父级字段名称
  * @param {string} [options.childrenField='children'] 子级字段名称
  * @param {'none'|'null'|'array'} [options.emptyChildrenValue='none'] 子级为空时的值，none表示删除该子级，null表示为null，array表示为[]。
+ * @param {'spread'|'self'} [options.nodeAssign='spread'] 节点赋值方式。spread表示使用展开运算符创建新值，self表示使用自身对象。
  * @returns {R[]} 树结构
  * @example
  * 
@@ -78,7 +79,9 @@ function listToTree(list) {
     _options$childrenFiel2 = options.childrenField,
     childrenField = _options$childrenFiel2 === void 0 ? 'children' : _options$childrenFiel2,
     _options$emptyChildre2 = options.emptyChildrenValue,
-    emptyChildrenValue = _options$emptyChildre2 === void 0 ? 'none' : _options$emptyChildre2;
+    emptyChildrenValue = _options$emptyChildre2 === void 0 ? 'none' : _options$emptyChildre2,
+    _options$nodeAssign = options.nodeAssign,
+    nodeAssign = _options$nodeAssign === void 0 ? 'spread' : _options$nodeAssign;
 
   /** @type {R[]} */
   var tree = [];
@@ -87,7 +90,7 @@ function listToTree(list) {
   var record = {};
   list.forEach(function (item) {
     if (isObject(item)) {
-      var newItem = _objectSpread({}, item);
+      var newItem = nodeAssign === 'spread' ? _objectSpread({}, item) : item;
 
       /** @type {string} */
       var id = newItem[keyField];

package/esm/transformFieldNames.doc.js

@@ -7,9 +7,10 @@
  * @static
  * @alias module:Processor.transformFieldNames
  * @since 4.14.0
- * @param {object[]} data 对象数组。如果是树结构数据，需要指定第三个参数 childrenFieldName
+ * @param {object[]} data 对象数组。如果是树结构数据，需要指定第三个参数 childrenField
  * @param {object} fieldNames 字段名映射
- * @param {string} [childrenFieldName] 子级数据字段名
+ * @param {string} [childrenField] 子级数据字段名
+ * @param {'spread'|'self'} [nodeAssign='spread'] 节点赋值方式。spread表示使用展开运算符创建新值，self表示使用自身对象。
  * @returns {object[]}
  * @example
  * 
@@ -30,5 +31,5 @@
  * 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) {}
 export default transformFieldNames;

package/esm/transformFieldNames.js

@@ -15,9 +15,10 @@ import { isObject } from './utils/type';
  * @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
  * 
@@ -38,7 +39,8 @@ import { isObject } from './utils/type';
  * 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;
   }
@@ -59,15 +61,15 @@ function transformFieldNames(data, fieldNames, childrenFieldName) {
       if (!isObject(item)) {
         return item;
       }
-      var newItem = _objectSpread({}, item);
+      var newItem = nodeAssign === 'spread' ? _objectSpread({}, item) : item;
       /** @type {Array.<string>} */
       var delKeys = [];
 
       // 树形数据子节点
       // @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());
       }
 
       // 替换字段名

package/esm/utils/config.js

@@ -15,5 +15,5 @@ function setDisableWarning(bool) {
 }
 
 // eslint-disable-next-line no-undef
-var version = "4.14.0";
+var version = "4.15.0";
 export { config, setDisableWarning, version };

package/lib/calculateCursorPosition.js

@@ -6,7 +6,7 @@ Object.defineProperty(exports, "__esModule", {
 exports["default"] = void 0;
 var _normalizeString = _interopRequireDefault(require("./normalizeString"));
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-// 参考了: 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
 
 /**
  * 计算输入框的值格式化后光标位置
@@ -14,8 +14,6 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
  * @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

package/lib/filterTree.js

@@ -0,0 +1,71 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports["default"] = void 0;
+var _type = require("./utils/type");
+function _typeof(obj) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }, _typeof(obj); }
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
+function _toPropertyKey(arg) { var key = _toPrimitive(arg, "string"); return _typeof(key) === "symbol" ? key : String(key); }
+function _toPrimitive(input, hint) { if (_typeof(input) !== "object" || input === null) return input; var prim = input[Symbol.toPrimitive]; if (prim !== undefined) { var res = prim.call(input, hint || "default"); if (_typeof(res) !== "object") return res; throw new TypeError("@@toPrimitive must return a primitive value."); } return (hint === "string" ? String : Number)(input); }
+/**
+ * 过滤/筛选树节点。<br/><br/>如果某节点被过滤掉，它的子节点也一并抛弃
+ * 
+ * @static
+ * @alias module:Processor.filterTree
+ * @since 4.15.0
+ * @template {any} T
+ * @template {(item: T) => boolean} F
+ * @param {T[]} tree 树结构数据
+ * @param {F} predicate 遍历每一项执行的函数，参数是当前遍历到的节点数据，如果返回 Truthy ，结果将包含该节点
+ * @param {string} [childrenField='children'] 子级字段名
+ * @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" }] }];
+ * 
+ * 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"}]}]
+ * 
+ * // 如果某节点被过滤掉，它的子节点也一并抛弃
+ * filterTree(menus, item=>item.id === '7');
+ * // []
+ * 
+ * filterTree(menus, item=>item.id === 'not found');
+ * // []
+ */
+function filterTree(tree, predicate) {
+  var childrenField = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'children';
+  var nodeAssign = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 'spread';
+  if (!Array.isArray(tree)) {
+    return tree;
+  }
+
+  /** @type {T[]} */
+  var result = [];
+  tree.forEach(function (item) {
+    var newItem = item;
+    if ((0, _type.isObject)(item)) {
+      // @ts-ignore
+      newItem = nodeAssign === 'spread' ? _objectSpread({}, item) : item;
+    }
+    if (predicate(newItem)) {
+      if ((0, _type.isObject)(newItem)) {
+        /** @type {T[]|undefined} */
+        // @ts-ignore
+        var childs = newItem[childrenField];
+        if (Array.isArray(childs) && childs.length > 0) {
+          // @ts-ignore
+          newItem[childrenField] = filterTree(childs, predicate, childrenField, nodeAssign);
+        }
+      }
+      result.push(newItem);
+    }
+  });
+  return result;
+}
+var _default = filterTree;
+exports["default"] = _default;

package/lib/findTreeNode.js

@@ -4,6 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports["default"] = void 0;
+var _type = require("./utils/type");
 function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
 function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
 function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
@@ -20,7 +21,7 @@ function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len
  * @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}
  * @example
@@ -55,11 +56,14 @@ function findTreeNode(tree, predicate) {
           node = temp;
           break;
         }
-
-        /** @type {T[]} */
-        // @ts-ignore
-        var children = temp[childrenField] || [];
-        stack.push.apply(stack, _toConsumableArray(children));
+        if ((0, _type.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;

package/lib/findTreeNodes.js

@@ -0,0 +1,79 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports["default"] = void 0;
+var _type = require("./utils/type");
+function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
+function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
+function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+/**
+ * 查找树结构数据多个节点
+ * 
+ * @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 ((0, _type.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;
+}
+var _default = findTreeNodes;
+exports["default"] = _default;

package/lib/findTreeSelect.js

@@ -35,13 +35,15 @@ function internalFindTreeSelect(tree, predicate) {
       if (predicate(item)) {
         return path;
       }
-
-      // @ts-ignore
-      if ((0, _type.isObject)(item) && Array.isArray(item[childrenField]) && item[childrenField].length > 0) {
+      if ((0, _type.isObject)(item)) {
+        /** @type {T[]} */
         // @ts-ignore
-        var findChildren = internalFindTreeSelect(item[childrenField], predicate, childrenField, path);
-        if (findChildren.length > 0) {
-          return findChildren;
+        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();

package/lib/index.js

@@ -33,12 +33,24 @@ Object.defineProperty(exports, "divide", {
     return _divide["default"];
   }
 });
+Object.defineProperty(exports, "filterTree", {
+  enumerable: true,
+  get: function get() {
+    return _filterTree["default"];
+  }
+});
 Object.defineProperty(exports, "findTreeNode", {
   enumerable: true,
   get: function get() {
     return _findTreeNode["default"];
   }
 });
+Object.defineProperty(exports, "findTreeNodes", {
+  enumerable: true,
+  get: function get() {
+    return _findTreeNodes["default"];
+  }
+});
 Object.defineProperty(exports, "findTreeSelect", {
   enumerable: true,
   get: function get() {
@@ -347,8 +359,7 @@ var _padZero = _interopRequireDefault(require("./padZero"));
 var _transformFieldNames = _interopRequireDefault(require("./transformFieldNames"));
 var _listToTree = _interopRequireDefault(require("./listToTree"));
 var _treeToList = _interopRequireDefault(require("./treeToList"));
-var _findTreeNode = _interopRequireDefault(require("./findTreeNode"));
-var _findTreeSelect = _interopRequireDefault(require("./findTreeSelect"));
+var _filterTree = _interopRequireDefault(require("./filterTree"));
 var _plus = _interopRequireDefault(require("./plus"));
 var _minus = _interopRequireDefault(require("./minus"));
 var _times = _interopRequireDefault(require("./times"));
@@ -358,5 +369,8 @@ var _waitTime = _interopRequireDefault(require("./waitTime"));
 var _calculateCursorPosition = _interopRequireDefault(require("./calculateCursorPosition"));
 var _randomString = _interopRequireDefault(require("./randomString"));
 var _strlen = _interopRequireDefault(require("./strlen"));
+var _findTreeNode = _interopRequireDefault(require("./findTreeNode"));
+var _findTreeNodes = _interopRequireDefault(require("./findTreeNodes"));
+var _findTreeSelect = _interopRequireDefault(require("./findTreeSelect"));
 var _config = require("./utils/config");
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }