web-component-gallery 0.1.63 → 0.1.64

package/dist/amap.umd.js

@@ -8999,7 +8999,7 @@ eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpac
 /***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
 
 "use strict";
-eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   filterTreeById: function() { return /* binding */ filterTreeById; },\n/* harmony export */   findCheckNodes: function() { return /* binding */ findCheckNodes; },\n/* harmony export */   getTreeKey: function() { return /* binding */ getTreeKey; },\n/* harmony export */   joinTreeMessage: function() { return /* binding */ joinTreeMessage; }\n/* harmony export */ });\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! core-js/modules/es.array.push.js */ \"./node_modules/core-js/modules/es.array.push.js\");\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__);\n\n/**\r\n * 获取树形结构所有key\r\n * @param nodes 数组对象\r\n * @param parent 是否只获取父一层的属性\r\n * @param replaceFields 自定义属性进行查询\r\n */\nfunction getTreeKey(nodes, parent = false, replaceFields = {\n  children: 'children',\n  key: 'id',\n  title: 'title'\n}) {\n  const filterNodes = [];\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      if (!parent) filterNodes.push(e[replaceFields.key]);\n      if (e[replaceFields.children]?.length) {\n        if (parent) filterNodes.push(e[replaceFields.key]);\n        generateList(e[replaceFields.children]);\n      }\n    });\n  }\n  generateList(nodes);\n  return filterNodes;\n}\n\n/**\r\n * 根据树子节点ID过滤出最后一级child\r\n * @param {array} dataSource 树形结构数据源\r\n * @param {array} nodeIds 需要过滤的数据集\r\n * @param {string} hasField 过滤包含属性(默认为children)\r\n * @param {string} searchField 查找属性(默认为id)\r\n */\n\nfunction findCheckNodes(dataSource, nodeIds, searchField = 'id', hasField = 'children') {\n  let checkNodes = [];\n  function traverse(node, nodeIds) {\n    if (nodeIds.includes(node[searchField]) && !node.hasOwnProperty(hasField)) {\n      checkNodes.push(node);\n      return true;\n    }\n    node[hasField] && node[hasField].forEach(childNode => {\n      if (traverse(childNode, nodeIds)) return true;\n    });\n    return false;\n  }\n  for (let i = 0; i < dataSource.length; i++) {\n    if (traverse(dataSource[i], nodeIds)) {\n      break;\n    }\n  }\n  return checkNodes;\n}\n\n/**\r\n * 根据要求拼接树结构字段 ( 比如：后端返回name phone，前端显示要求name后拼接phone\r\n * @param nodes 数组对象\r\n * @param fileds 哪些字段需要拼接\r\n * @param replaceField 拼接后赋值字段\r\n * @param childNode 子级结点\r\n */\nfunction joinTreeMessage(nodes, fileds, replaceField, childNode) {\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      e[replaceField] = '';\n      fileds.forEach(filed => e[filed] && (e[replaceField] += ` ${e[filed]}`));\n      if (e[childNode]?.length) {\n        generateList(e[childNode]);\n      }\n    });\n  }\n  generateList(nodes);\n  return nodes;\n}\n\n/**\r\n * 根据某个属性查找出整个树结构中匹配相同的数据\r\n * @param tree 数组对象\r\n * @param key 需要查找的属性\r\n * @param replaceFields 树结构对应子级及查找key的属性\r\n * {\r\n      children: 'children', // 查找子级字段\r\n      key: 'id'  // key的字段\r\n    }\r\n */\nfunction filterTreeById(tree, key, replaceFields = {\n  children: 'children',\n  key: 'id'\n}) {\n  return tree.reduce((acc, node) => {\n    if (node[replaceFields.key] === key) {\n      return [...acc, node];\n    } else if (node[replaceFields.children] && node[replaceFields.children].length > 0) {\n      const filteredChildren = filterTreeById(node[replaceFields.children], key);\n      if (filteredChildren.length > 0) return filteredChildren;\n    }\n    return acc;\n  }, []);\n}\n\n//# sourceURL=webpack://mui/./plugins/utils/Tree.js?");
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   filterTreeById: function() { return /* binding */ filterTreeById; },\n/* harmony export */   findCheckNodes: function() { return /* binding */ findCheckNodes; },\n/* harmony export */   getAllParents: function() { return /* binding */ getAllParents; },\n/* harmony export */   getTreeKey: function() { return /* binding */ getTreeKey; },\n/* harmony export */   joinTreeMessage: function() { return /* binding */ joinTreeMessage; }\n/* harmony export */ });\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! core-js/modules/es.array.push.js */ \"./node_modules/core-js/modules/es.array.push.js\");\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__);\n\n/**\r\n * 获取树形结构所有key\r\n * @param nodes 数组对象\r\n * @param parent 是否只获取父一层的属性\r\n * @param replaceFields 自定义属性进行查询\r\n */\nfunction getTreeKey(nodes, parent = false, replaceFields = {\n  children: 'children',\n  key: 'id',\n  title: 'title'\n}) {\n  const filterNodes = [];\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      if (!parent) filterNodes.push(e[replaceFields.key]);\n      if (e[replaceFields.children]?.length) {\n        if (parent) filterNodes.push(e[replaceFields.key]);\n        generateList(e[replaceFields.children]);\n      }\n    });\n  }\n  generateList(nodes);\n  return filterNodes;\n}\n\n/**\r\n * 根据树子节点ID过滤出最后一级child\r\n * @param {array} dataSource 树形结构数据源\r\n * @param {array} nodeIds 需要过滤的数据集\r\n * @param {string} hasField 过滤包含属性(默认为children)\r\n * @param {string} searchField 查找属性(默认为id)\r\n */\n\nfunction findCheckNodes(dataSource, nodeIds, searchField = 'id', hasField = 'children') {\n  let checkNodes = [];\n  function traverse(node, nodeIds) {\n    if (nodeIds.includes(node[searchField]) && !node.hasOwnProperty(hasField)) {\n      checkNodes.push(node);\n      return true;\n    }\n    node[hasField] && node[hasField].forEach(childNode => {\n      if (traverse(childNode, nodeIds)) return true;\n    });\n    return false;\n  }\n  for (let i = 0; i < dataSource.length; i++) {\n    if (traverse(dataSource[i], nodeIds)) {\n      break;\n    }\n  }\n  return checkNodes;\n}\n\n/**\r\n * 根据要求拼接树结构字段 ( 比如：后端返回name phone，前端显示要求name后拼接phone\r\n * @param nodes 数组对象\r\n * @param fileds 哪些字段需要拼接\r\n * @param replaceField 拼接后赋值字段\r\n * @param childNode 子级结点\r\n */\nfunction joinTreeMessage(nodes, fileds, replaceField, childNode) {\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      e[replaceField] = '';\n      fileds.forEach(filed => e[filed] && (e[replaceField] += ` ${e[filed]}`));\n      if (e[childNode]?.length) {\n        generateList(e[childNode]);\n      }\n    });\n  }\n  generateList(nodes);\n  return nodes;\n}\n\n/**\r\n * 根据某个属性查找出整个树结构中匹配相同的数据\r\n * @param tree 数组对象\r\n * @param key 需要查找的属性\r\n * @param replaceFields 树结构对应子级及查找key的属性\r\n * {\r\n      children: 'children', // 查找子级字段\r\n      key: 'id'  // key的字段\r\n    }\r\n */\nfunction filterTreeById(tree, key, replaceFields = {\n  children: 'children',\n  key: 'id'\n}) {\n  return tree.reduce((acc, node) => {\n    if (node[replaceFields.key] === key) {\n      return [...acc, node];\n    } else if (node[replaceFields.children] && node[replaceFields.children].length > 0) {\n      const filteredChildren = filterTreeById(node[replaceFields.children], key);\n      if (filteredChildren.length > 0) return filteredChildren;\n    }\n    return acc;\n  }, []);\n}\n\n/**\r\n * 根据最后一级子id获取全部父id\r\n * @param tree 数组对象\r\n * @param key 需要查找的属性\r\n * @param replaceFields 树结构对应子级及查找key的属性\r\n * {\r\n      children: 'children', // 查找子级字段\r\n      key: 'id'  // key的字段\r\n    }\r\n */\nfunction getAllParents(tree, key, replaceFields = {\n  children: 'children',\n  key: 'id'\n}) {\n  let parents = [];\n  let inx = 0;\n  function findParents(nodes, count) {\n    nodes.forEach(node => {\n      inx = count;\n      parents[count] = node[replaceFields.key];\n      if (node[replaceFields.key] === key) {\n        parents = parents.slice(0, count + 1);\n        return;\n      } else {\n        if (node[replaceFields.children] && node[replaceFields.children].length > 0) {\n          inx++;\n          findParents(node[replaceFields.children], inx);\n        }\n      }\n    });\n    return parents;\n  }\n  return findParents(tree, inx);\n}\n\n//# sourceURL=webpack://mui/./plugins/utils/Tree.js?");
 
 /***/ }),
 

package/dist/index.umd.js

@@ -8999,7 +8999,7 @@ eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpac
 /***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
 
 "use strict";
-eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   filterTreeById: function() { return /* binding */ filterTreeById; },\n/* harmony export */   findCheckNodes: function() { return /* binding */ findCheckNodes; },\n/* harmony export */   getTreeKey: function() { return /* binding */ getTreeKey; },\n/* harmony export */   joinTreeMessage: function() { return /* binding */ joinTreeMessage; }\n/* harmony export */ });\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! core-js/modules/es.array.push.js */ \"./node_modules/core-js/modules/es.array.push.js\");\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__);\n\n/**\r\n * 获取树形结构所有key\r\n * @param nodes 数组对象\r\n * @param parent 是否只获取父一层的属性\r\n * @param replaceFields 自定义属性进行查询\r\n */\nfunction getTreeKey(nodes, parent = false, replaceFields = {\n  children: 'children',\n  key: 'id',\n  title: 'title'\n}) {\n  const filterNodes = [];\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      if (!parent) filterNodes.push(e[replaceFields.key]);\n      if (e[replaceFields.children]?.length) {\n        if (parent) filterNodes.push(e[replaceFields.key]);\n        generateList(e[replaceFields.children]);\n      }\n    });\n  }\n  generateList(nodes);\n  return filterNodes;\n}\n\n/**\r\n * 根据树子节点ID过滤出最后一级child\r\n * @param {array} dataSource 树形结构数据源\r\n * @param {array} nodeIds 需要过滤的数据集\r\n * @param {string} hasField 过滤包含属性(默认为children)\r\n * @param {string} searchField 查找属性(默认为id)\r\n */\n\nfunction findCheckNodes(dataSource, nodeIds, searchField = 'id', hasField = 'children') {\n  let checkNodes = [];\n  function traverse(node, nodeIds) {\n    if (nodeIds.includes(node[searchField]) && !node.hasOwnProperty(hasField)) {\n      checkNodes.push(node);\n      return true;\n    }\n    node[hasField] && node[hasField].forEach(childNode => {\n      if (traverse(childNode, nodeIds)) return true;\n    });\n    return false;\n  }\n  for (let i = 0; i < dataSource.length; i++) {\n    if (traverse(dataSource[i], nodeIds)) {\n      break;\n    }\n  }\n  return checkNodes;\n}\n\n/**\r\n * 根据要求拼接树结构字段 ( 比如：后端返回name phone，前端显示要求name后拼接phone\r\n * @param nodes 数组对象\r\n * @param fileds 哪些字段需要拼接\r\n * @param replaceField 拼接后赋值字段\r\n * @param childNode 子级结点\r\n */\nfunction joinTreeMessage(nodes, fileds, replaceField, childNode) {\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      e[replaceField] = '';\n      fileds.forEach(filed => e[filed] && (e[replaceField] += ` ${e[filed]}`));\n      if (e[childNode]?.length) {\n        generateList(e[childNode]);\n      }\n    });\n  }\n  generateList(nodes);\n  return nodes;\n}\n\n/**\r\n * 根据某个属性查找出整个树结构中匹配相同的数据\r\n * @param tree 数组对象\r\n * @param key 需要查找的属性\r\n * @param replaceFields 树结构对应子级及查找key的属性\r\n * {\r\n      children: 'children', // 查找子级字段\r\n      key: 'id'  // key的字段\r\n    }\r\n */\nfunction filterTreeById(tree, key, replaceFields = {\n  children: 'children',\n  key: 'id'\n}) {\n  return tree.reduce((acc, node) => {\n    if (node[replaceFields.key] === key) {\n      return [...acc, node];\n    } else if (node[replaceFields.children] && node[replaceFields.children].length > 0) {\n      const filteredChildren = filterTreeById(node[replaceFields.children], key);\n      if (filteredChildren.length > 0) return filteredChildren;\n    }\n    return acc;\n  }, []);\n}\n\n//# sourceURL=webpack://mui/./plugins/utils/Tree.js?");
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   filterTreeById: function() { return /* binding */ filterTreeById; },\n/* harmony export */   findCheckNodes: function() { return /* binding */ findCheckNodes; },\n/* harmony export */   getAllParents: function() { return /* binding */ getAllParents; },\n/* harmony export */   getTreeKey: function() { return /* binding */ getTreeKey; },\n/* harmony export */   joinTreeMessage: function() { return /* binding */ joinTreeMessage; }\n/* harmony export */ });\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! core-js/modules/es.array.push.js */ \"./node_modules/core-js/modules/es.array.push.js\");\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__);\n\n/**\r\n * 获取树形结构所有key\r\n * @param nodes 数组对象\r\n * @param parent 是否只获取父一层的属性\r\n * @param replaceFields 自定义属性进行查询\r\n */\nfunction getTreeKey(nodes, parent = false, replaceFields = {\n  children: 'children',\n  key: 'id',\n  title: 'title'\n}) {\n  const filterNodes = [];\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      if (!parent) filterNodes.push(e[replaceFields.key]);\n      if (e[replaceFields.children]?.length) {\n        if (parent) filterNodes.push(e[replaceFields.key]);\n        generateList(e[replaceFields.children]);\n      }\n    });\n  }\n  generateList(nodes);\n  return filterNodes;\n}\n\n/**\r\n * 根据树子节点ID过滤出最后一级child\r\n * @param {array} dataSource 树形结构数据源\r\n * @param {array} nodeIds 需要过滤的数据集\r\n * @param {string} hasField 过滤包含属性(默认为children)\r\n * @param {string} searchField 查找属性(默认为id)\r\n */\n\nfunction findCheckNodes(dataSource, nodeIds, searchField = 'id', hasField = 'children') {\n  let checkNodes = [];\n  function traverse(node, nodeIds) {\n    if (nodeIds.includes(node[searchField]) && !node.hasOwnProperty(hasField)) {\n      checkNodes.push(node);\n      return true;\n    }\n    node[hasField] && node[hasField].forEach(childNode => {\n      if (traverse(childNode, nodeIds)) return true;\n    });\n    return false;\n  }\n  for (let i = 0; i < dataSource.length; i++) {\n    if (traverse(dataSource[i], nodeIds)) {\n      break;\n    }\n  }\n  return checkNodes;\n}\n\n/**\r\n * 根据要求拼接树结构字段 ( 比如：后端返回name phone，前端显示要求name后拼接phone\r\n * @param nodes 数组对象\r\n * @param fileds 哪些字段需要拼接\r\n * @param replaceField 拼接后赋值字段\r\n * @param childNode 子级结点\r\n */\nfunction joinTreeMessage(nodes, fileds, replaceField, childNode) {\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      e[replaceField] = '';\n      fileds.forEach(filed => e[filed] && (e[replaceField] += ` ${e[filed]}`));\n      if (e[childNode]?.length) {\n        generateList(e[childNode]);\n      }\n    });\n  }\n  generateList(nodes);\n  return nodes;\n}\n\n/**\r\n * 根据某个属性查找出整个树结构中匹配相同的数据\r\n * @param tree 数组对象\r\n * @param key 需要查找的属性\r\n * @param replaceFields 树结构对应子级及查找key的属性\r\n * {\r\n      children: 'children', // 查找子级字段\r\n      key: 'id'  // key的字段\r\n    }\r\n */\nfunction filterTreeById(tree, key, replaceFields = {\n  children: 'children',\n  key: 'id'\n}) {\n  return tree.reduce((acc, node) => {\n    if (node[replaceFields.key] === key) {\n      return [...acc, node];\n    } else if (node[replaceFields.children] && node[replaceFields.children].length > 0) {\n      const filteredChildren = filterTreeById(node[replaceFields.children], key);\n      if (filteredChildren.length > 0) return filteredChildren;\n    }\n    return acc;\n  }, []);\n}\n\n/**\r\n * 根据最后一级子id获取全部父id\r\n * @param tree 数组对象\r\n * @param key 需要查找的属性\r\n * @param replaceFields 树结构对应子级及查找key的属性\r\n * {\r\n      children: 'children', // 查找子级字段\r\n      key: 'id'  // key的字段\r\n    }\r\n */\nfunction getAllParents(tree, key, replaceFields = {\n  children: 'children',\n  key: 'id'\n}) {\n  let parents = [];\n  let inx = 0;\n  function findParents(nodes, count) {\n    nodes.forEach(node => {\n      inx = count;\n      parents[count] = node[replaceFields.key];\n      if (node[replaceFields.key] === key) {\n        parents = parents.slice(0, count + 1);\n        return;\n      } else {\n        if (node[replaceFields.children] && node[replaceFields.children].length > 0) {\n          inx++;\n          findParents(node[replaceFields.children], inx);\n        }\n      }\n    });\n    return parents;\n  }\n  return findParents(tree, inx);\n}\n\n//# sourceURL=webpack://mui/./plugins/utils/Tree.js?");
 
 /***/ }),
 

package/dist/tree.umd.js

@@ -3401,7 +3401,7 @@ eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpac
 /***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
 
 "use strict";
-eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   filterTreeById: function() { return /* binding */ filterTreeById; },\n/* harmony export */   findCheckNodes: function() { return /* binding */ findCheckNodes; },\n/* harmony export */   getTreeKey: function() { return /* binding */ getTreeKey; },\n/* harmony export */   joinTreeMessage: function() { return /* binding */ joinTreeMessage; }\n/* harmony export */ });\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! core-js/modules/es.array.push.js */ \"./node_modules/core-js/modules/es.array.push.js\");\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__);\n\n/**\r\n * 获取树形结构所有key\r\n * @param nodes 数组对象\r\n * @param parent 是否只获取父一层的属性\r\n * @param replaceFields 自定义属性进行查询\r\n */\nfunction getTreeKey(nodes, parent = false, replaceFields = {\n  children: 'children',\n  key: 'id',\n  title: 'title'\n}) {\n  const filterNodes = [];\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      if (!parent) filterNodes.push(e[replaceFields.key]);\n      if (e[replaceFields.children]?.length) {\n        if (parent) filterNodes.push(e[replaceFields.key]);\n        generateList(e[replaceFields.children]);\n      }\n    });\n  }\n  generateList(nodes);\n  return filterNodes;\n}\n\n/**\r\n * 根据树子节点ID过滤出最后一级child\r\n * @param {array} dataSource 树形结构数据源\r\n * @param {array} nodeIds 需要过滤的数据集\r\n * @param {string} hasField 过滤包含属性(默认为children)\r\n * @param {string} searchField 查找属性(默认为id)\r\n */\n\nfunction findCheckNodes(dataSource, nodeIds, searchField = 'id', hasField = 'children') {\n  let checkNodes = [];\n  function traverse(node, nodeIds) {\n    if (nodeIds.includes(node[searchField]) && !node.hasOwnProperty(hasField)) {\n      checkNodes.push(node);\n      return true;\n    }\n    node[hasField] && node[hasField].forEach(childNode => {\n      if (traverse(childNode, nodeIds)) return true;\n    });\n    return false;\n  }\n  for (let i = 0; i < dataSource.length; i++) {\n    if (traverse(dataSource[i], nodeIds)) {\n      break;\n    }\n  }\n  return checkNodes;\n}\n\n/**\r\n * 根据要求拼接树结构字段 ( 比如：后端返回name phone，前端显示要求name后拼接phone\r\n * @param nodes 数组对象\r\n * @param fileds 哪些字段需要拼接\r\n * @param replaceField 拼接后赋值字段\r\n * @param childNode 子级结点\r\n */\nfunction joinTreeMessage(nodes, fileds, replaceField, childNode) {\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      e[replaceField] = '';\n      fileds.forEach(filed => e[filed] && (e[replaceField] += ` ${e[filed]}`));\n      if (e[childNode]?.length) {\n        generateList(e[childNode]);\n      }\n    });\n  }\n  generateList(nodes);\n  return nodes;\n}\n\n/**\r\n * 根据某个属性查找出整个树结构中匹配相同的数据\r\n * @param tree 数组对象\r\n * @param key 需要查找的属性\r\n * @param replaceFields 树结构对应子级及查找key的属性\r\n * {\r\n      children: 'children', // 查找子级字段\r\n      key: 'id'  // key的字段\r\n    }\r\n */\nfunction filterTreeById(tree, key, replaceFields = {\n  children: 'children',\n  key: 'id'\n}) {\n  return tree.reduce((acc, node) => {\n    if (node[replaceFields.key] === key) {\n      return [...acc, node];\n    } else if (node[replaceFields.children] && node[replaceFields.children].length > 0) {\n      const filteredChildren = filterTreeById(node[replaceFields.children], key);\n      if (filteredChildren.length > 0) return filteredChildren;\n    }\n    return acc;\n  }, []);\n}\n\n//# sourceURL=webpack://mui/./plugins/utils/Tree.js?");
+eval("__webpack_require__.r(__webpack_exports__);\n/* harmony export */ __webpack_require__.d(__webpack_exports__, {\n/* harmony export */   filterTreeById: function() { return /* binding */ filterTreeById; },\n/* harmony export */   findCheckNodes: function() { return /* binding */ findCheckNodes; },\n/* harmony export */   getAllParents: function() { return /* binding */ getAllParents; },\n/* harmony export */   getTreeKey: function() { return /* binding */ getTreeKey; },\n/* harmony export */   joinTreeMessage: function() { return /* binding */ joinTreeMessage; }\n/* harmony export */ });\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! core-js/modules/es.array.push.js */ \"./node_modules/core-js/modules/es.array.push.js\");\n/* harmony import */ var core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(core_js_modules_es_array_push_js__WEBPACK_IMPORTED_MODULE_0__);\n\n/**\r\n * 获取树形结构所有key\r\n * @param nodes 数组对象\r\n * @param parent 是否只获取父一层的属性\r\n * @param replaceFields 自定义属性进行查询\r\n */\nfunction getTreeKey(nodes, parent = false, replaceFields = {\n  children: 'children',\n  key: 'id',\n  title: 'title'\n}) {\n  const filterNodes = [];\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      if (!parent) filterNodes.push(e[replaceFields.key]);\n      if (e[replaceFields.children]?.length) {\n        if (parent) filterNodes.push(e[replaceFields.key]);\n        generateList(e[replaceFields.children]);\n      }\n    });\n  }\n  generateList(nodes);\n  return filterNodes;\n}\n\n/**\r\n * 根据树子节点ID过滤出最后一级child\r\n * @param {array} dataSource 树形结构数据源\r\n * @param {array} nodeIds 需要过滤的数据集\r\n * @param {string} hasField 过滤包含属性(默认为children)\r\n * @param {string} searchField 查找属性(默认为id)\r\n */\n\nfunction findCheckNodes(dataSource, nodeIds, searchField = 'id', hasField = 'children') {\n  let checkNodes = [];\n  function traverse(node, nodeIds) {\n    if (nodeIds.includes(node[searchField]) && !node.hasOwnProperty(hasField)) {\n      checkNodes.push(node);\n      return true;\n    }\n    node[hasField] && node[hasField].forEach(childNode => {\n      if (traverse(childNode, nodeIds)) return true;\n    });\n    return false;\n  }\n  for (let i = 0; i < dataSource.length; i++) {\n    if (traverse(dataSource[i], nodeIds)) {\n      break;\n    }\n  }\n  return checkNodes;\n}\n\n/**\r\n * 根据要求拼接树结构字段 ( 比如：后端返回name phone，前端显示要求name后拼接phone\r\n * @param nodes 数组对象\r\n * @param fileds 哪些字段需要拼接\r\n * @param replaceField 拼接后赋值字段\r\n * @param childNode 子级结点\r\n */\nfunction joinTreeMessage(nodes, fileds, replaceField, childNode) {\n  function generateList(checkNodes) {\n    checkNodes.forEach(e => {\n      e[replaceField] = '';\n      fileds.forEach(filed => e[filed] && (e[replaceField] += ` ${e[filed]}`));\n      if (e[childNode]?.length) {\n        generateList(e[childNode]);\n      }\n    });\n  }\n  generateList(nodes);\n  return nodes;\n}\n\n/**\r\n * 根据某个属性查找出整个树结构中匹配相同的数据\r\n * @param tree 数组对象\r\n * @param key 需要查找的属性\r\n * @param replaceFields 树结构对应子级及查找key的属性\r\n * {\r\n      children: 'children', // 查找子级字段\r\n      key: 'id'  // key的字段\r\n    }\r\n */\nfunction filterTreeById(tree, key, replaceFields = {\n  children: 'children',\n  key: 'id'\n}) {\n  return tree.reduce((acc, node) => {\n    if (node[replaceFields.key] === key) {\n      return [...acc, node];\n    } else if (node[replaceFields.children] && node[replaceFields.children].length > 0) {\n      const filteredChildren = filterTreeById(node[replaceFields.children], key);\n      if (filteredChildren.length > 0) return filteredChildren;\n    }\n    return acc;\n  }, []);\n}\n\n/**\r\n * 根据最后一级子id获取全部父id\r\n * @param tree 数组对象\r\n * @param key 需要查找的属性\r\n * @param replaceFields 树结构对应子级及查找key的属性\r\n * {\r\n      children: 'children', // 查找子级字段\r\n      key: 'id'  // key的字段\r\n    }\r\n */\nfunction getAllParents(tree, key, replaceFields = {\n  children: 'children',\n  key: 'id'\n}) {\n  let parents = [];\n  let inx = 0;\n  function findParents(nodes, count) {\n    nodes.forEach(node => {\n      inx = count;\n      parents[count] = node[replaceFields.key];\n      if (node[replaceFields.key] === key) {\n        parents = parents.slice(0, count + 1);\n        return;\n      } else {\n        if (node[replaceFields.children] && node[replaceFields.children].length > 0) {\n          inx++;\n          findParents(node[replaceFields.children], inx);\n        }\n      }\n    });\n    return parents;\n  }\n  return findParents(tree, inx);\n}\n\n//# sourceURL=webpack://mui/./plugins/utils/Tree.js?");
 
 /***/ }),
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "web-component-gallery",
-  "version": "0.1.63",
+  "version": "0.1.64",
   "description": "vue-library-ui组件库",
   "main": "dist/index.umd.js",
   "files": [

package/plugins/utils/Tree.js

@@ -117,4 +117,39 @@ export function filterTreeById(tree, key, replaceFields = { children: 'children'
     }
     return acc
   }, [])
+}
+
+
+/**
+ * 根据最后一级子id获取全部父id
+ * @param tree 数组对象
+ * @param key 需要查找的属性
+ * @param replaceFields 树结构对应子级及查找key的属性
+ * {
+      children: 'children', // 查找子级字段
+      key: 'id'  // key的字段
+    }
+ */
+export function getAllParents(tree, key, replaceFields = { children: 'children', key: 'id' }) {
+  let parents = []
+  let inx = 0
+ 
+  function findParents(nodes, count) {
+    nodes.forEach(node => {
+      inx = count
+      parents[count] = node[replaceFields.key]
+      if (node[replaceFields.key] === key) {
+        parents = parents.slice(0, count + 1)
+        return
+      } else {
+        if (node[replaceFields.children] && node[replaceFields.children].length > 0) {
+          inx++
+          findParents(node[replaceFields.children], inx)
+        }
+      }
+    })
+    return parents
+  }
+ 
+  return findParents(tree, inx) 
 }

package/utils/Tree.js

@@ -117,4 +117,39 @@ export function filterTreeById(tree, key, replaceFields = { children: 'children'
     }
     return acc
   }, [])
+}
+
+
+/**
+ * 根据最后一级子id获取全部父id
+ * @param tree 数组对象
+ * @param key 需要查找的属性
+ * @param replaceFields 树结构对应子级及查找key的属性
+ * {
+      children: 'children', // 查找子级字段
+      key: 'id'  // key的字段
+    }
+ */
+export function getAllParents(tree, key, replaceFields = { children: 'children', key: 'id' }) {
+  let parents = []
+  let inx = 0
+ 
+  function findParents(nodes, count) {
+    nodes.forEach(node => {
+      inx = count
+      parents[count] = node[replaceFields.key]
+      if (node[replaceFields.key] === key) {
+        parents = parents.slice(0, count + 1)
+        return
+      } else {
+        if (node[replaceFields.children] && node[replaceFields.children].length > 0) {
+          inx++
+          findParents(node[replaceFields.children], inx)
+        }
+      }
+    })
+    return parents
+  }
+ 
+  return findParents(tree, inx) 
 }