web-component-gallery 1.1.35 → 1.1.37

package/dist/amap.umd.js

@@ -9349,7 +9349,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 */   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], parent, replaceFields);\n      }\n    });\n  }\n  generateList(nodes, parent, replaceFields);\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, replaceFields);\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, nodeId, replaceFields = {}) {\n  const {\n    children = 'children',\n    key = 'id'\n  } = replaceFields;\n  const toFlatArray = (tree, parentId) => {\n    return tree.reduce((t, _) => {\n      const child = _[children];\n      return [...t, parentId ? {\n        ..._,\n        parentId\n      } : _, ...(child && child.length ? toFlatArray(child, _[key]) : [])];\n    }, []);\n  };\n  const getIds = flatArray => {\n    let ids = [nodeId];\n    let child = flatArray.find(_ => _[key] === nodeId);\n    while (child && child.parentId) {\n      ids = [child.parentId, ...ids];\n      child = flatArray.find(_ => _[key] === child.parentId);\n    }\n    return ids;\n  };\n  return getIds(toFlatArray(tree));\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/** 默认TreeData字段 */\nconst defaultReplaceFields = {\n  key: 'id',\n  title: 'title',\n  children: 'children'\n};\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], parent, replaceFields);\n      }\n    });\n  }\n  generateList(nodes, parent, replaceFields);\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, replaceFields);\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, nodeId, replaceFields = {}) {\n  const {\n    children = 'children',\n    key = 'id'\n  } = replaceFields;\n  const toFlatArray = (tree, parentId) => {\n    return tree.reduce((t, _) => {\n      const child = _[children];\n      return [...t, parentId ? {\n        ..._,\n        parentId\n      } : _, ...(child && child.length ? toFlatArray(child, _[key]) : [])];\n    }, []);\n  };\n  const getIds = flatArray => {\n    let ids = [nodeId];\n    let child = flatArray.find(_ => _[key] === nodeId);\n    while (child && child.parentId) {\n      ids = [child.parentId, ...ids];\n      child = flatArray.find(_ => _[key] === child.parentId);\n    }\n    return ids;\n  };\n  return getIds(toFlatArray(tree));\n}\n\n//# sourceURL=webpack://mui/./plugins/utils/Tree.js?");
 
 /***/ }),
 

package/dist/index.umd.js

@@ -9349,7 +9349,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 */   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], parent, replaceFields);\n      }\n    });\n  }\n  generateList(nodes, parent, replaceFields);\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, replaceFields);\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, nodeId, replaceFields = {}) {\n  const {\n    children = 'children',\n    key = 'id'\n  } = replaceFields;\n  const toFlatArray = (tree, parentId) => {\n    return tree.reduce((t, _) => {\n      const child = _[children];\n      return [...t, parentId ? {\n        ..._,\n        parentId\n      } : _, ...(child && child.length ? toFlatArray(child, _[key]) : [])];\n    }, []);\n  };\n  const getIds = flatArray => {\n    let ids = [nodeId];\n    let child = flatArray.find(_ => _[key] === nodeId);\n    while (child && child.parentId) {\n      ids = [child.parentId, ...ids];\n      child = flatArray.find(_ => _[key] === child.parentId);\n    }\n    return ids;\n  };\n  return getIds(toFlatArray(tree));\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/** 默认TreeData字段 */\nconst defaultReplaceFields = {\n  key: 'id',\n  title: 'title',\n  children: 'children'\n};\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], parent, replaceFields);\n      }\n    });\n  }\n  generateList(nodes, parent, replaceFields);\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, replaceFields);\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, nodeId, replaceFields = {}) {\n  const {\n    children = 'children',\n    key = 'id'\n  } = replaceFields;\n  const toFlatArray = (tree, parentId) => {\n    return tree.reduce((t, _) => {\n      const child = _[children];\n      return [...t, parentId ? {\n        ..._,\n        parentId\n      } : _, ...(child && child.length ? toFlatArray(child, _[key]) : [])];\n    }, []);\n  };\n  const getIds = flatArray => {\n    let ids = [nodeId];\n    let child = flatArray.find(_ => _[key] === nodeId);\n    while (child && child.parentId) {\n      ids = [child.parentId, ...ids];\n      child = flatArray.find(_ => _[key] === child.parentId);\n    }\n    return ids;\n  };\n  return getIds(toFlatArray(tree));\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 */   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], parent, replaceFields);\n      }\n    });\n  }\n  generateList(nodes, parent, replaceFields);\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, replaceFields);\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, nodeId, replaceFields = {}) {\n  const {\n    children = 'children',\n    key = 'id'\n  } = replaceFields;\n  const toFlatArray = (tree, parentId) => {\n    return tree.reduce((t, _) => {\n      const child = _[children];\n      return [...t, parentId ? {\n        ..._,\n        parentId\n      } : _, ...(child && child.length ? toFlatArray(child, _[key]) : [])];\n    }, []);\n  };\n  const getIds = flatArray => {\n    let ids = [nodeId];\n    let child = flatArray.find(_ => _[key] === nodeId);\n    while (child && child.parentId) {\n      ids = [child.parentId, ...ids];\n      child = flatArray.find(_ => _[key] === child.parentId);\n    }\n    return ids;\n  };\n  return getIds(toFlatArray(tree));\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/** 默认TreeData字段 */\nconst defaultReplaceFields = {\n  key: 'id',\n  title: 'title',\n  children: 'children'\n};\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], parent, replaceFields);\n      }\n    });\n  }\n  generateList(nodes, parent, replaceFields);\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, replaceFields);\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, nodeId, replaceFields = {}) {\n  const {\n    children = 'children',\n    key = 'id'\n  } = replaceFields;\n  const toFlatArray = (tree, parentId) => {\n    return tree.reduce((t, _) => {\n      const child = _[children];\n      return [...t, parentId ? {\n        ..._,\n        parentId\n      } : _, ...(child && child.length ? toFlatArray(child, _[key]) : [])];\n    }, []);\n  };\n  const getIds = flatArray => {\n    let ids = [nodeId];\n    let child = flatArray.find(_ => _[key] === nodeId);\n    while (child && child.parentId) {\n      ids = [child.parentId, ...ids];\n      child = flatArray.find(_ => _[key] === child.parentId);\n    }\n    return ids;\n  };\n  return getIds(toFlatArray(tree));\n}\n\n//# sourceURL=webpack://mui/./plugins/utils/Tree.js?");
 
 /***/ }),
 

package/package.json

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

package/plugins/utils/Filter.js

@@ -240,17 +240,17 @@ export function findNthOccurrence(str, charToFind, n) {
  */
 export function handleEnvURL(url, port) {
 
-  let newUrl
-  try {
-      newUrl = new URL(url).href
-  } catch(error) {
-      newUrl = port ?
-               location.origin.slice(0, -4) + 
-               port + 
-               url.slice(findNthOccurrence(url, '/', 1)) :
-               location.origin + url
-  }
-  return newUrl
+    let newUrl
+    try {
+        newUrl = new URL(url).href
+    } catch(error) {
+        newUrl = port ?
+                location.origin.slice(0, -4) + 
+                port + 
+                url.slice(findNthOccurrence(url, '/', 1)) :
+                location.origin + url
+    }
+    return newUrl
 
 }
 

package/plugins/utils/Tree.js

@@ -1,4 +1,9 @@
-
+/** 默认TreeData字段 */
+const defaultReplaceFields = {
+  key: 'id', 
+  title: 'title',
+  children: 'children'
+}
 
 /**
  * 获取树形结构所有key

package/plugins/utils/Validate.js

@@ -8,7 +8,9 @@ export const verifyPassword = /^(?=.*[a-z])(?=.*[A-Z])(?=.*[!@#$%^&*()]).{8,}$/;
 export const phoneReg = /^(13[0-9]|14[01456879]|15[0-35-9]|16[2567]|17[0-8]|18[0-9]|19[0-35-9])\d{8}$/; //手机号
 export const telephone = /^((0\d{2,3}-\d{7,8})|(1[3584]\d{9}))$/; //固定电话与手机号
 export const verifyEmail =  /^([a-zA-Z0-9]+[_|\_|\.]?)*[a-zA-Z0-9]+@([a-zA-Z0-9]+[_|\_|\.]?)*[a-zA-Z0-9]+\.[a-zA-Z]{2,3}$/; //检验邮箱
-export const verifyIdCard = /(^\d{15}$)|(^\d{18}$)|(^\d{17}(\d|X|x)$)/    //身份证号码  15位或18位  
+export const verifyIdCard = /(^\d{15}$)|(^\d{18}$)|(^\d{17}(\d|X|x)$)/;    //身份证号码  15位或18位  
+export const verifyIPStr = /(25[0-5]|2[0-4]\d|1\d{2}|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d{2}|[1-9]?\d)){3}/g;  //校验字符串是否包含ip地址
+export const verifyCDN = /^\/\/at\.alicdn\.com\/t\/[cf]\/font_\d+_[a-z0-9]+\.js$/;  //校验阿里云CDN链接格式
 
 /** 截取字符串中的ip及端口 */
 export function extractIPAndPort(str) {

package/utils/Filter.js

@@ -240,17 +240,17 @@ export function findNthOccurrence(str, charToFind, n) {
  */
 export function handleEnvURL(url, port) {
 
-  let newUrl
-  try {
-      newUrl = new URL(url).href
-  } catch(error) {
-      newUrl = port ?
-               location.origin.slice(0, -4) + 
-               port + 
-               url.slice(findNthOccurrence(url, '/', 1)) :
-               location.origin + url
-  }
-  return newUrl
+    let newUrl
+    try {
+        newUrl = new URL(url).href
+    } catch(error) {
+        newUrl = port ?
+                location.origin.slice(0, -4) + 
+                port + 
+                url.slice(findNthOccurrence(url, '/', 1)) :
+                location.origin + url
+    }
+    return newUrl
 
 }
 

package/utils/Tree.js

@@ -1,4 +1,9 @@
-
+/** 默认TreeData字段 */
+const defaultReplaceFields = {
+  key: 'id', 
+  title: 'title',
+  children: 'children'
+}
 
 /**
  * 获取树形结构所有key

package/utils/Validate.js

@@ -8,7 +8,9 @@ export const verifyPassword = /^(?=.*[a-z])(?=.*[A-Z])(?=.*[!@#$%^&*()]).{8,}$/;
 export const phoneReg = /^(13[0-9]|14[01456879]|15[0-35-9]|16[2567]|17[0-8]|18[0-9]|19[0-35-9])\d{8}$/; //手机号
 export const telephone = /^((0\d{2,3}-\d{7,8})|(1[3584]\d{9}))$/; //固定电话与手机号
 export const verifyEmail =  /^([a-zA-Z0-9]+[_|\_|\.]?)*[a-zA-Z0-9]+@([a-zA-Z0-9]+[_|\_|\.]?)*[a-zA-Z0-9]+\.[a-zA-Z]{2,3}$/; //检验邮箱
-export const verifyIdCard = /(^\d{15}$)|(^\d{18}$)|(^\d{17}(\d|X|x)$)/    //身份证号码  15位或18位  
+export const verifyIdCard = /(^\d{15}$)|(^\d{18}$)|(^\d{17}(\d|X|x)$)/;    //身份证号码  15位或18位  
+export const verifyIPStr = /(25[0-5]|2[0-4]\d|1\d{2}|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d{2}|[1-9]?\d)){3}/g;  //校验字符串是否包含ip地址
+export const verifyCDN = /^\/\/at\.alicdn\.com\/t\/[cf]\/font_\d+_[a-z0-9]+\.js$/;  //校验阿里云CDN链接格式
 
 /** 截取字符串中的ip及端口 */
 export function extractIPAndPort(str) {