util-helpers 4.16.2 → 4.17.1

package/lib/fileReader.js

@@ -1,74 +1,23 @@
-"use strict";
+'use strict';
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports["default"] = void 0;
 var FileReaderMethodMap = {
-  arrayBuffer: 'readAsArrayBuffer',
-  binaryString: 'readAsBinaryString',
-  dataURL: 'readAsDataURL',
-  text: 'readAsText'
+    arrayBuffer: 'readAsArrayBuffer',
+    binaryString: 'readAsBinaryString',
+    dataURL: 'readAsDataURL',
+    text: 'readAsText'
 };
-
-/**
- * @overload
- * @param {Blob} blob
- * @param {'arrayBuffer'} type
- * @returns {Promise<ArrayBuffer>}
- */
-
-/**
- * @overload
- * @param {Blob} blob
- * @param {'binaryString'|'binaryString'|'dataURL'|'text'} [type='dataURL']
- * @returns {Promise<string>}
- */
-
-/**
- * 读取 Blob 或 File 对象，转为 Base64/String/ArrayBuffer<br/><br/>
- * 
- * <em style="font-weight: bold;">注意：该方法仅适用于浏览器端。</em>
- *
- * @static
- * @alias module:Processor.fileReader
- * @see {@link https://developer.mozilla.org/zh-CN/docs/Web/API/FileReader|FileReader}
- * @since 4.16.0
- * @param {Blob} blob Blob 或 File 对象
- * @param {'arrayBuffer'|'binaryString'|'dataURL'|'text'} [type='dataURL'] Blob 或 File 对象
- * @returns {Promise<string|ArrayBuffer>} 文件的内容
- * @example
- * const aFileParts = ['<a id="a"><b id="b">hey!</b></a>']; // 一个包含DOMString的数组
- * const htmlBlob = new Blob(aFileParts, { type: 'text/html' }); // 得到 blob
- *
- * fileReader(htmlBlob).then(data=>{
- *   console.log(data); // data:text/html;base64,PGEgaWQ9ImEiPjxiIGlkPSJiIj5oZXkhPC9iPjwvYT4=
- * });
- *
- * const textBlob = new Blob(aFileParts, { type: 'text/plain' });
- *
- * fileReader(textBlob, 'text').then(data=>{
- *   console.log(data); // <a id="a"><b id="b">hey!</b></a>
- * });
- */
-function fileReader(blob) {
-  var type = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'dataURL';
-  var method = FileReaderMethodMap[type];
-  if (!method) {
-    method = FileReaderMethodMap.dataURL;
-  }
-  return new Promise(function (resolve, reject) {
-    var reader = new FileReader();
-    // @ts-ignore
-    reader[method](blob);
-    // @ts-ignore
-    reader.onload = function () {
-      return resolve(reader.result);
-    };
-    reader.onerror = function (error) {
-      return reject(error);
-    };
-  });
+function fileReader(blob, type) {
+    if (type === void 0) { type = 'dataURL'; }
+    var method = FileReaderMethodMap[type];
+    if (!method) {
+        method = FileReaderMethodMap.dataURL;
+    }
+    return new Promise(function (resolve, reject) {
+        var reader = new FileReader();
+        reader[method](blob);
+        reader.onload = function () { return resolve(reader.result); };
+        reader.onerror = function (error) { return reject(error); };
+    });
 }
-var _default = fileReader;
-exports["default"] = _default;
+
+module.exports = fileReader;

package/lib/filterTree.js

@@ -1,70 +1,31 @@
-"use strict";
+'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:Tree.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';
-  /** @type {T[]} */
-  var result = [];
-  if (!Array.isArray(tree)) {
-    return result;
-  }
-  tree.forEach(function (item) {
-    var newItem = item;
-    if ((0, _type.isObject)(item)) {
-      // @ts-ignore
-      newItem = nodeAssign === 'spread' ? _objectSpread({}, item) : item;
+var tslib = require('tslib');
+var isObject = require('./utils/type/isObject.js');
+
+function filterTree(tree, predicate, childrenField, nodeAssign) {
+    if (childrenField === void 0) { childrenField = 'children'; }
+    if (nodeAssign === void 0) { nodeAssign = 'spread'; }
+    var result = [];
+    if (!Array.isArray(tree)) {
+        return result;
     }
-    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);
+    tree.forEach(function (item) {
+        var newItem = item;
+        if (isObject(item)) {
+            newItem = nodeAssign === 'spread' ? tslib.__assign({}, item) : item;
         }
-      }
-      result.push(newItem);
-    }
-  });
-  return result;
+        if (predicate(newItem)) {
+            if (isObject(newItem)) {
+                var childs = newItem[childrenField];
+                if (Array.isArray(childs) && childs.length > 0) {
+                    newItem[childrenField] = filterTree(childs, predicate, childrenField, nodeAssign);
+                }
+            }
+            result.push(newItem);
+        }
+    });
+    return result;
 }
-var _default = filterTree;
-exports["default"] = _default;
+
+module.exports = filterTree;

package/lib/findTreeNode.js

@@ -1,83 +1,46 @@
-"use strict";
+'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:Tree.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 = [];
+var tslib = require('tslib');
+var isObject = require('./utils/type/isObject.js');
 
-  /** @type {T|undefined} */
-  var node;
-  if (!Array.isArray(tree)) {
-    return 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;
+function findTreeNode(tree, predicate, childrenField) {
+    var e_1, _a;
+    if (childrenField === void 0) { childrenField = 'children'; }
+    var stack = [];
+    var node;
+    if (!Array.isArray(tree)) {
+        return node;
+    }
+    try {
+        for (var tree_1 = tslib.__values(tree), tree_1_1 = tree_1.next(); !tree_1_1.done; tree_1_1 = tree_1.next()) {
+            var item = tree_1_1.value;
+            stack.push(item);
+            while (stack.length) {
+                var temp = stack.pop();
+                if (predicate(temp)) {
+                    node = temp;
+                    break;
+                }
+                if (isObject(temp)) {
+                    var childs = temp[childrenField];
+                    if (Array.isArray(childs) && childs.length > 0) {
+                        stack.push.apply(stack, tslib.__spreadArray([], tslib.__read(childs), false));
+                    }
+                }
+            }
+            if (node) {
+                break;
+            }
         }
-        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 (e_1_1) { e_1 = { error: e_1_1 }; }
+    finally {
+        try {
+            if (tree_1_1 && !tree_1_1.done && (_a = tree_1.return)) _a.call(tree_1);
         }
-      }
-      if (node) {
-        break;
-      }
+        finally { if (e_1) throw e_1.error; }
     }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
-  }
-  return node;
+    return node;
 }
-var _default = findTreeNode;
-exports["default"] = _default;
+
+module.exports = findTreeNode;

package/lib/findTreeNodes.js

@@ -1,82 +1,42 @@
-"use strict";
+'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:Tree.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 = [];
+var tslib = require('tslib');
+var isObject = require('./utils/type/isObject.js');
 
-  /** @type {T[]} */
-  var nodes = [];
-  if (!Array.isArray(tree)) {
-    return 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);
+function findTreeNodes(tree, predicate, childrenField) {
+    var e_1, _a;
+    if (childrenField === void 0) { childrenField = 'children'; }
+    var stack = [];
+    var nodes = [];
+    if (!Array.isArray(tree)) {
+        return nodes;
+    }
+    try {
+        for (var tree_1 = tslib.__values(tree), tree_1_1 = tree_1.next(); !tree_1_1.done; tree_1_1 = tree_1.next()) {
+            var item = tree_1_1.value;
+            stack.push(item);
+            while (stack.length) {
+                var temp = stack.pop();
+                if (predicate(temp)) {
+                    nodes.push(temp);
+                }
+                if (isObject(temp)) {
+                    var childs = temp[childrenField];
+                    if (Array.isArray(childs) && childs.length > 0) {
+                        stack.push.apply(stack, tslib.__spreadArray([], tslib.__read(childs), false));
+                    }
+                }
+            }
         }
-        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 (e_1_1) { e_1 = { error: e_1_1 }; }
+    finally {
+        try {
+            if (tree_1_1 && !tree_1_1.done && (_a = tree_1.return)) _a.call(tree_1);
         }
-      }
+        finally { if (e_1) throw e_1.error; }
     }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
-  }
-  return nodes;
+    return nodes;
 }
-var _default = findTreeNodes;
-exports["default"] = _default;
+
+module.exports = findTreeNodes;

package/lib/findTreeSelect.js

@@ -1,87 +1,45 @@
-"use strict";
+'use strict';
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports["default"] = void 0;
-var _type = require("./utils/type");
-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; }
-/**
- * 内部实现
- * 
- * @private
- * @template {any} T
- * @template {(item: T) => boolean} F
- * @param {T[]} tree 树结构数据
- * @param {F} predicate 遍历每一项执行的函数，参数是当前遍历到的节点数据，如果返回 Truthy 将返回包含该节点的所有父级节点
- * @param {string} [childrenField] 子级字段名
- * @param {T[]} [path=[]] 当前遍历路径
- * @returns {T[]}
- */
-function internalFindTreeSelect(tree, predicate, childrenField) {
-  var path = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
-  if (!Array.isArray(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 ((0, _type.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;
-          }
+var tslib = require('tslib');
+var isObject = require('./utils/type/isObject.js');
+
+function internalFindTreeSelect(tree, predicate, childrenField, path) {
+    var e_1, _a;
+    if (path === void 0) { path = []; }
+    if (!Array.isArray(tree)) {
+        return [];
+    }
+    try {
+        for (var tree_1 = tslib.__values(tree), tree_1_1 = tree_1.next(); !tree_1_1.done; tree_1_1 = tree_1.next()) {
+            var item = tree_1_1.value;
+            path.push(item);
+            if (predicate(item)) {
+                return path;
+            }
+            if (isObject(item)) {
+                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 (e_1_1) { e_1 = { error: e_1_1 }; }
+    finally {
+        try {
+            if (tree_1_1 && !tree_1_1.done && (_a = tree_1.return)) _a.call(tree_1);
         }
-      }
-      path.pop();
+        finally { if (e_1) throw e_1.error; }
     }
-  } catch (err) {
-    _iterator.e(err);
-  } finally {
-    _iterator.f();
-  }
-  return [];
+    return [];
 }
-
-/**
- * 查找包含当前节点的所有父级节点
- * 
- * @static
- * @alias module:Tree.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);
+function findTreeSelect(tree, predicate, childrenField) {
+    if (childrenField === void 0) { childrenField = 'children'; }
+    return internalFindTreeSelect(tree, predicate, childrenField);
 }
-var _default = findTreeSelect;
-exports["default"] = _default;
+
+module.exports = findTreeSelect;