tntd 3.0.9 → 3.0.11-beta.1

package/lib/tntd-virtual-tree-select/utils.js

@@ -3,165 +3,46 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.getNodeStr = exports.getNodeKeys = exports.getFullExpandedKeys = exports.flatTreeData = exports.addTreeNodeKeys = void 0;
-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 _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
+exports.flatWithParents = exports.filterLastestNode = void 0;
+function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _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 _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 _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 _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; }
-var __rest = void 0 && (void 0).__rest || function (s, e) {
-  var t = {};
-  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0) t[p] = s[p];
-  if (s != null && typeof Object.getOwnPropertySymbols === "function") for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
-    if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i])) t[p[i]] = s[p[i]];
-  }
-  return t;
-};
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _iterableToArray(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
+function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 /**
- * 初始化给树的每个节点增加一个keys字段（数组），keys的值是当前节点下的所有子节点的value和
- * 用于判断后续展开/收起
+ * 给每个节点增加一个parent字段，记录其父节点用于showCheckedStrategy
  * @param {*} treeData
+ * @param {*} fieldNames
+ * @param {*} parents
+ * @returns
  */
-var addTreeNodeKeys = exports.addTreeNodeKeys = function addTreeNodeKeys(treeData) {
+var _flatWithParents = exports.flatWithParents = function flatWithParents(treeData) {
   var fieldNames = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {
     title: 'title',
     value: 'value',
-    children: 'children'
+    children: 'children',
+    disabled: 'disabled'
   };
-  if (Array.isArray(treeData) && !!treeData.length) {
-    return treeData.map(function (item) {
-      item.children = item[fieldNames['children']];
-      item.title = item[fieldNames['title']];
-      item.value = item[fieldNames['value']];
-      var children = item.children,
-        query = __rest(item, ["children"]);
-      if (Array.isArray(children) && !!children.length) {
-        query.children = addTreeNodeKeys(children, fieldNames);
-      }
-      return Object.assign(Object.assign({}, query), {
-        title: query[fieldNames['title']],
-        value: query[fieldNames['value']],
-        keys: getNodeKeys(query),
-        titleTotal: getNodeStr(query, fieldNames['title'])
-      });
-    });
-  }
-  return [];
-};
-var getNodeStr = exports.getNodeStr = function getNodeStr(node, key) {
-  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
-  result.push(node[key]);
-  if (Array.isArray(node.children) && !!node.children.length) {
-    node.children.forEach(function (element) {
-      result = [].concat(_toConsumableArray(result), _toConsumableArray(getNodeStr(element, key)));
+  var parents = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  var result = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};
+  if (Array.isArray(treeData)) {
+    treeData.forEach(function (i) {
+      result[i[fieldNames['value']]] = parents;
+      if (Array.isArray(i[fieldNames['children']])) {
+        var list = _flatWithParents(i[fieldNames['children']], fieldNames, [].concat(_toConsumableArray(parents), [i[fieldNames['value']]]));
+        result = Object.assign(Object.assign({}, result), list);
+      } else {}
     });
   }
   return result;
 };
-/**
- * 获取每个节点下面所有子节点的value值
- * @param {*} node
- * @param {*} widthSelf 是否包含自己
- * @param {*} result
- * @returns []
- */
-var getNodeKeys = exports.getNodeKeys = function getNodeKeys(node) {
-  var widthSelf = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
-  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
-  if (widthSelf) {
-    result.push(node.value);
-  }
-  if (Array.isArray(node.children) && !!node.children.length) {
-    node.children.forEach(function (element) {
-      result = [].concat(_toConsumableArray(result), _toConsumableArray(getNodeKeys(element)));
+var filterLastestNode = exports.filterLastestNode = function filterLastestNode(treeNodeWithParents, item, list) {
+  var parents = treeNodeWithParents[item] || {};
+  if (Array.isArray(parents) && !!parents.length && Array.isArray(list) && !!list.length) {
+    return parents.every(function (el) {
+      return !list.includes(el);
     });
   }
-  return result;
-};
-/**
- * 扁平树
- * @param {*} treeData
- * @param {*} expandedKeys 展开的节点
- * @param {*} treeDefaultExpandAll
- * @param {*} level
- * @param {*} result
- * @returns
- */
-var flatTreeData = exports.flatTreeData = function flatTreeData(treeData) {
-  var filterKey = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';
-  var expandedKeys = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
-  var treeDefaultExpandAll = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
-  var level = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 0;
-  var result = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : [];
-  if (Array.isArray(treeData)) {
-    var _iterator = _createForOfIteratorHelper(treeData),
-      _step;
-    try {
-      for (_iterator.s(); !(_step = _iterator.n()).done;) {
-        var i = _step.value;
-        var value = i.value,
-          children = i.children,
-          titleTotal = i.titleTotal,
-          title = i.title,
-          rest = __rest(i, ["value", "children", "titleTotal", "title"]);
-        // 判断是否命中过滤
-        var bingo = true;
-        var transFilterKey = !['', null, undefined].includes(filterKey);
-        if (transFilterKey) {
-          bingo = Array.isArray(titleTotal) ? titleTotal.some(function (i) {
-            return i.includes(filterKey);
-          }) : false;
-        }
-        if (bingo) {
-          result.push({
-            value: value,
-            children: children,
-            title: title,
-            level: level,
-            titleTotal: titleTotal
-          });
-        }
-        var selfIn = Array.isArray(expandedKeys) ? expandedKeys.includes(value) : false;
-        if ((treeDefaultExpandAll || selfIn || transFilterKey && bingo) && Array.isArray(children) && !!children.length) {
-          result = [].concat(_toConsumableArray(result), _toConsumableArray(flatTreeData(children, filterKey, expandedKeys, treeDefaultExpandAll, level + 1)));
-        }
-      }
-    } catch (err) {
-      _iterator.e(err);
-    } finally {
-      _iterator.f();
-    }
-  }
-  return result;
-};
-/**
- * 获取所有展开的节点 （组件传入最后一层，需要将其上层全部加入到expandedKeys）
- * @param {*} treeDataWithKeys
- * @param {*} treeExpandedKeys
- * @param {*} result
- * @returns
- */
-var getFullExpandedKeys = exports.getFullExpandedKeys = function getFullExpandedKeys(treeDataWithKeys) {
-  var treeExpandedKeys = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
-  var treeDefaultExpandAll = arguments.length > 2 ? arguments[2] : undefined;
-  var result = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
-  if (!treeDefaultExpandAll && (!Array.isArray(treeDataWithKeys) || !treeDataWithKeys.length || !Array.isArray(treeExpandedKeys) || !treeExpandedKeys.length)) {
-    return [];
-  }
-  treeDataWithKeys.forEach(function (i) {
-    var keys = i.keys,
-      value = i.value,
-      children = i.children;
-    if (treeDefaultExpandAll || Array.isArray(keys) && keys.some(function (el) {
-      return treeExpandedKeys.includes(el);
-    })) {
-      result.push(value);
-      if (Array.isArray(children) && !!children.length) {
-        result = [].concat(_toConsumableArray(result), _toConsumableArray(getFullExpandedKeys(children, treeExpandedKeys, treeDefaultExpandAll)));
-      }
-    }
-  });
-  return result;
+  return false;
 };

package/lib/tntd-virtual-tree-select/utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../src/tntd-virtual-tree-select/utils.js"],"names":[],"mappings":";;;;;;;;;;;;;;AAAA;;;;GAIG;AACI,MAAM,eAAe,GAAG,CAAC,QAAQ,EAAE,UAAU,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE;IACjH,IAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE;QAC/C,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YAC3B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAA;YAC5C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAA;YACtC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAA;YACtC,MAAM,EAAE,QAAQ,KAAe,IAAI,EAAd,KAAK,UAAK,IAAI,EAA7B,YAAsB,CAAO,CAAC;YACpC,IAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE;gBAC/C,KAAK,CAAC,QAAQ,GAAG,IAAA,uBAAe,EAAC,QAAQ,EAAE,UAAU,CAAC,CAAA;aACvD;YACD,uCACK,KAAK,KACR,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EACjC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EACjC,IAAI,EAAE,IAAA,mBAAW,EAAC,KAAK,CAAC,EACxB,UAAU,EAAE,IAAA,kBAAU,EAAC,KAAK,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,IACnD;QACH,CAAC,CAAC,CAAA;KACH;IAED,OAAO,EAAE,CAAA;AACX,CAAC,CAAA;AArBY,QAAA,eAAe,mBAqB3B;AAEM,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IACnD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAEvB,IAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;QACzD,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;YAC9B,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,kBAAU,EAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAA;QACnD,CAAC,CAAC,CAAC;KACJ;IAED,OAAO,MAAM,CAAA;AACf,CAAC,CAAA;AAVY,QAAA,UAAU,cAUtB;AAED;;;;;;GAMG;AACI,MAAM,WAAW,GAAG,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IACjE,IAAG,SAAS,EAAE;QACZ,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;KACzB;IAED,IAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;QACzD,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;YAC9B,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,mBAAW,EAAC,OAAO,CAAC,CAAC,CAAA;QAC/C,CAAC,CAAC,CAAC;KACJ;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAA;AAZY,QAAA,WAAW,eAYvB;AAED;;;;;;;;GAQG;AACI,MAAM,YAAY,GAAG,CAAC,QAAQ,EAAE,SAAS,GAAG,EAAE,EAAE,YAAY,GAAG,EAAE,EAAE,oBAAoB,GAAG,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IAChI,IAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAC1B,KAAI,MAAM,CAAC,IAAI,QAAQ,EAAC;YACtB,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK,KAAc,CAAC,EAAV,IAAI,UAAK,CAAC,EAAnD,4CAA+C,CAAI,CAAC;YAE1D,WAAW;YACX,IAAI,KAAK,GAAG,IAAI,CAAA;YAChB,MAAM,cAAc,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;YACjE,IAAG,cAAc,EAAE;gBACjB,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;aACxF;YAED,IAAG,KAAK,EAAE;gBACR,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAA;aAC3D;YAED,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAClF,IAAG,CAAC,oBAAoB,IAAI,MAAM,IAAI,CAAC,cAAc,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAC;gBAC/G,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,oBAAY,EAAC,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,oBAAoB,EAAE,KAAK,GAAC,CAAC,CAAC,CAAC,CAAA;aACxG;SACF;KACF;IACD,OAAO,MAAM,CAAA;AACf,CAAC,CAAA;AAvBY,QAAA,YAAY,gBAuBxB;AAED;;;;;;GAMG;AACI,MAAM,mBAAmB,GAAG,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,EAAE,EAAE,oBAAoB,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IAChH,IAAG,CAAC,oBAAoB,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE;QAC1J,OAAO,EAAE,CAAA;KACV;IAED,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QAC3B,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QAEpC,IAAG,oBAAoB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YAClG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAElB,IAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE;gBAC/C,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,2BAAmB,EAAC,QAAQ,EAAE,gBAAgB,EAAE,oBAAoB,CAAC,CAAC,CAAA;aAC/F;SACF;IACH,CAAC,CAAC,CAAA;IAEF,OAAO,MAAM,CAAC;AAChB,CAAC,CAAA;AAlBY,QAAA,mBAAmB,uBAkB/B","sourcesContent":["/**\n * 初始化给树的每个节点增加一个keys字段（数组），keys的值是当前节点下的所有子节点的value和\n * 用于判断后续展开/收起\n * @param {*} treeData \n */\nexport const addTreeNodeKeys = (treeData, fieldNames = { title: 'title', value: 'value', children: 'children' }) => {\n  if(Array.isArray(treeData) && !!treeData.length) {\n    return treeData.map((item) => {\n      item.children = item[fieldNames['children']]\n      item.title = item[fieldNames['title']]\n      item.value = item[fieldNames['value']]\n      const { children, ...query } = item;\n      if(Array.isArray(children) && !!children.length) {\n        query.children = addTreeNodeKeys(children, fieldNames)\n      } \n      return {\n        ...query,\n        title: query[fieldNames['title']],\n        value: query[fieldNames['value']],\n        keys: getNodeKeys(query),\n        titleTotal: getNodeStr(query, fieldNames['title'])\n      }\n    })\n  }\n\n  return []\n}\n\nexport const getNodeStr = (node, key, result = []) => {\n  result.push(node[key]);\n\n  if(Array.isArray(node.children) && !!node.children.length) {\n    node.children.forEach(element => {\n      result = [...result, ...getNodeStr(element, key)]\n    });\n  }\n\n  return result\n}\n\n/**\n * 获取每个节点下面所有子节点的value值\n * @param {*} node \n * @param {*} widthSelf 是否包含自己\n * @param {*} result \n * @returns []\n */\nexport const getNodeKeys = (node, widthSelf = true, result = []) => {\n  if(widthSelf) {\n    result.push(node.value);\n  }\n\n  if(Array.isArray(node.children) && !!node.children.length) {\n    node.children.forEach(element => {\n      result = [...result, ...getNodeKeys(element)]\n    });\n  }\n\n  return result;\n}\n\n/**\n * 扁平树\n * @param {*} treeData \n * @param {*} expandedKeys 展开的节点\n * @param {*} treeDefaultExpandAll\n * @param {*} level \n * @param {*} result \n * @returns \n */\nexport const flatTreeData = (treeData, filterKey = '', expandedKeys = [], treeDefaultExpandAll = false, level = 0, result = []) => {\n  if(Array.isArray(treeData)) {\n    for(const i of treeData){\n      const { value, children, titleTotal, title, ...rest } = i;\n\n      // 判断是否命中过滤\n      let bingo = true\n      const transFilterKey = !['', null, undefined].includes(filterKey)\n      if(transFilterKey) {\n        bingo = Array.isArray(titleTotal) ? titleTotal.some(i => i.includes(filterKey)) : false\n      }\n\n      if(bingo) {\n        result.push({ value, children, title, level, titleTotal })\n      }\n\n      const selfIn = Array.isArray(expandedKeys) ? expandedKeys.includes(value) : false;\n      if((treeDefaultExpandAll || selfIn || (transFilterKey && bingo)) && Array.isArray(children) && !!children.length){\n        result = [...result, ...flatTreeData(children, filterKey, expandedKeys, treeDefaultExpandAll, level+1)]\n      }\n    }\n  }\n  return result\n}\n\n/**\n * 获取所有展开的节点 （组件传入最后一层，需要将其上层全部加入到expandedKeys）\n * @param {*} treeDataWithKeys \n * @param {*} treeExpandedKeys \n * @param {*} result \n * @returns \n */\nexport const getFullExpandedKeys = (treeDataWithKeys, treeExpandedKeys = [], treeDefaultExpandAll, result = []) => {\n  if(!treeDefaultExpandAll && (!Array.isArray(treeDataWithKeys) || !treeDataWithKeys.length || !Array.isArray(treeExpandedKeys) || !treeExpandedKeys.length)) {\n    return []\n  }\n  \n  treeDataWithKeys.forEach(i => {\n    const { keys, value, children } = i;\n\n    if(treeDefaultExpandAll || (Array.isArray(keys) && keys.some(el => treeExpandedKeys.includes(el)))) {\n      result.push(value)\n\n      if(Array.isArray(children) && !!children.length) {\n        result = [...result, ...getFullExpandedKeys(children, treeExpandedKeys, treeDefaultExpandAll)]\n      }\n    }\n  })\n\n  return result;\n}\n\n\n"]}
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../src/tntd-virtual-tree-select/utils.js"],"names":[],"mappings":";;;AAAA;;;;;;GAMG;AACI,MAAM,eAAe,GAAG,CAAC,QAAQ,EAAE,UAAU,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,OAAO,GAAG,EAAE,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IAClK,IAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAC1B,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACnB,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;YACzC,IAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,EAAC;gBAC1C,MAAM,IAAI,GAAG,IAAA,uBAAe,EAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;gBACzG,MAAM,mCAAO,MAAM,GAAK,IAAI,CAAC,CAAA;aAC9B;iBAAI;aAEJ;QACH,CAAC,CAAC,CAAA;KACH;IACD,OAAO,MAAM,CAAA;AACf,CAAC,CAAA;AAbY,QAAA,eAAe,mBAa3B;AAEM,MAAM,iBAAiB,GAAG,CAAC,mBAAmB,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;IACnE,MAAM,OAAO,GAAG,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAA;IAE/C,IAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE;QACrF,OAAO,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAA;KAC/C;IAED,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AARY,QAAA,iBAAiB,qBAQ7B","sourcesContent":["/**\n * 给每个节点增加一个parent字段，记录其父节点用于showCheckedStrategy\n * @param {*} treeData \n * @param {*} fieldNames \n * @param {*} parents \n * @returns \n */\nexport const flatWithParents = (treeData, fieldNames = { title: 'title', value: 'value', children: 'children', disabled: 'disabled' }, parents = [], result = {}) => {\n  if(Array.isArray(treeData)) {\n    treeData.forEach(i => {\n      result[i[fieldNames['value']]] = parents;\n      if(Array.isArray(i[fieldNames['children']])){\n        const list = flatWithParents(i[fieldNames['children']], fieldNames, [...parents, i[fieldNames['value']]])\n        result = {...result, ...list}\n      }else{\n        \n      }\n    })\n  }\n  return result\n}\n\nexport const filterLastestNode = (treeNodeWithParents, item, list) => {\n  const parents = treeNodeWithParents[item] || {}\n \n  if(Array.isArray(parents) && !!parents.length && Array.isArray(list) && !!list.length) {\n    return parents.every(el => !list.includes(el))\n  }\n\n  return false\n}\n\n"]}

package/lib/tooltip/tooltip.js

@@ -23,7 +23,7 @@ Object.keys(_tooltip).forEach(function (key) {
 var _classnames = _interopRequireDefault(require("classnames"));
 function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(e) { return e ? t : r; })(e); }
 function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != _typeof(e) && "function" != typeof e) return { "default": e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && {}.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n["default"] = e, t && t.set(e, n), n; }
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
 var __rest = void 0 && (void 0).__rest || function (s, e) {
   var t = {};
   for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0) t[p] = s[p];

package/lib/upload/index.js

@@ -23,7 +23,7 @@ var _connect = require("../connect");
 require("./style");
 function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(e) { return e ? t : r; })(e); }
 function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != _typeof(e) && "function" != typeof e) return { "default": e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && {}.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n["default"] = e, t && t.set(e, n), n; }
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
 var Upload = (0, _connect.connectReadonlyComponent)(_upload["default"], function (props) {
   return _react["default"].createElement(_upload["default"], Object.assign({}, props, {
     disabled: true

package/lib/utils/checkAuth.js

@@ -5,9 +5,9 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.getCheckAuth = exports["default"] = void 0;
 var _get2 = _interopRequireDefault(require("lodash/get"));
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
 var getCheckAuth = exports.getCheckAuth = function getCheckAuth(menus) {
-  var getAuthMap = function getAuthMap() {
+  var _getAuthMap = function getAuthMap() {
     var menus = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
     var authMap = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
     return menus.reduce(function (acc, _ref) {
@@ -16,7 +16,7 @@ var getCheckAuth = exports.getCheckAuth = function getCheckAuth(menus) {
         functionList = _ref.functionList,
         children = _ref.children;
       if (groupName) {
-        return getAuthMap(children, acc);
+        return _getAuthMap(children, acc);
       } else {
         acc[code] = acc[code] || {};
         acc[code] = (functionList || []).reduce(function (acc, curFunc) {
@@ -27,7 +27,7 @@ var getCheckAuth = exports.getCheckAuth = function getCheckAuth(menus) {
       }
     }, authMap);
   };
-  var authMap = getAuthMap(menus);
+  var authMap = _getAuthMap(menus);
   return function (menuCode, funCode) {
     return !!(0, _get2["default"])(authMap, "".concat(menuCode).concat(funCode ? ".".concat(funCode) : ''));
   };

package/lib/utils/index.js

@@ -63,12 +63,12 @@ Object.keys(_lang).forEach(function (key) {
   });
 });
 var _prevLocale = require("../prev-locale");
-function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
+function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _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 _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 _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 _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; }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _iterableToArray(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
+function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 var isGroupMenu = exports.isGroupMenu = function isGroupMenu(menu) {
   return (menu === null || menu === void 0 ? void 0 : menu.children) && !(menu === null || menu === void 0 ? void 0 : menu.path);
 };
@@ -78,7 +78,7 @@ var getSelectedMenuInfo = exports.getSelectedMenuInfo = function getSelectedMenu
   var menu;
   var parentMenus = [];
   if (selectedKey) {
-    traverseTree(menus, function (node, pnode, pnodes) {
+    _traverseTree(menus, function (node, pnode, pnodes) {
       if (!isGroupMenu(node) && node.code === selectedKey) {
         subMenu = node;
         menu = pnode;
@@ -88,7 +88,7 @@ var getSelectedMenuInfo = exports.getSelectedMenuInfo = function getSelectedMenu
     });
   } else {
     // 默认找到第一个菜单项
-    traverseTree(menus, function (node, pnode, pnodes) {
+    _traverseTree(menus, function (node, pnode, pnodes) {
       if (!isGroupMenu(node)) {
         subMenu = node;
         menu = pnode;
@@ -121,7 +121,7 @@ var isNewTabMenu = exports.isNewTabMenu = function isNewTabMenu(menu) {
 var openInNewTab = exports.openInNewTab = function openInNewTab(path) {
   window.open(path, '_blank');
 };
-var traverseTree = exports.traverseTree = function traverseTree(treeData, callback, pnode) {
+var _traverseTree = exports.traverseTree = function traverseTree(treeData, callback, pnode) {
   var pnodes = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
   ;
   (treeData || []).every(function (node, index) {
@@ -133,7 +133,7 @@ var traverseTree = exports.traverseTree = function traverseTree(treeData, callba
     }
     // 回调函数返回false则终止遍历
     if (result !== false) {
-      node && traverseTree(node.children || [], callback, node, [node].concat(_toConsumableArray(pnodes)));
+      node && _traverseTree(node.children || [], callback, node, [node].concat(_toConsumableArray(pnodes)));
     }
     return result !== false;
   });

package/lib/utils/lang.js

@@ -6,7 +6,7 @@ Object.defineProperty(exports, "__esModule", {
 exports.titleHandle = exports.titleCaseUpper = exports.prepositions = exports.doUpperTitle = exports.articles = void 0;
 var _react = _interopRequireDefault(require("react"));
 var _prevLocale = require("../prev-locale");
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
 var prepositions = exports.prepositions = ['about', 'above', 'across', 'after', 'against', 'along', 'among', 'around', 'as', 'at', 'before', 'behind', 'below', 'beneath', 'beside', 'between', 'beyond', 'by', 'down', 'during', 'except', 'for', 'from', 'in', 'inside', 'into', 'like', 'near', 'of', 'off', 'on', 'onto', 'out', 'outside', 'over', 'past', 'round', 'since', 'through', 'throughout', 'to', 'toward', 'under', 'underneath', 'until', 'up', 'upon', 'with', 'within', 'without', 'or'];
 var articles = exports.articles = ['the', 'a', 'an'];
 var titleHandle = exports.titleHandle = function titleHandle(str) {
@@ -50,7 +50,7 @@ var titleCaseUpper = exports.titleCaseUpper = function titleCaseUpper(str) {
   }
   return str;
 };
-var doUpperTitle = exports.doUpperTitle = function doUpperTitle(label) {
+var _doUpperTitle = exports.doUpperTitle = function doUpperTitle(label) {
   var upperCaseIgnore = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
   var _a, _b, _c, _d, _e, _f, _g, _h, _j, _k;
   if ((0, _prevLocale.getLanguage)() === 'cn') {
@@ -67,7 +67,7 @@ var doUpperTitle = exports.doUpperTitle = function doUpperTitle(label) {
         return Object.assign(Object.assign({}, label), {
           props: Object.assign(Object.assign({}, label.props), {
             children: (_d = (_c = label === null || label === void 0 ? void 0 : label.props) === null || _c === void 0 ? void 0 : _c.children) === null || _d === void 0 ? void 0 : _d.map(function (subLabel) {
-              return doUpperTitle(subLabel, upperCaseIgnore);
+              return _doUpperTitle(subLabel, upperCaseIgnore);
             })
           })
         });

package/lib/water-mark/index.js

@@ -9,13 +9,13 @@ var _classnames = _interopRequireDefault(require("classnames"));
 var _react = _interopRequireWildcard(require("react"));
 function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(e) { return e ? t : r; })(e); }
 function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != _typeof(e) && "function" != typeof e) return { "default": e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && {}.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n["default"] = e, t && t.set(e, n), n; }
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
+function _slicedToArray(r, e) { return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest(); }
 function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
-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; }
+function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
+function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t["return"] && (u = t["return"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
-function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
+function _arrayWithHoles(r) { if (Array.isArray(r)) return r; }
 /**
  * 返回当前显示设备的物理像素分辨率与CSS像素分辨率之比
  *

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "tntd",
-    "version": "3.0.9",
+    "version": "3.0.11-beta.1",
     "license": "MIT",
     "scripts": {
         "start": "heft start --storybook",
@@ -43,7 +43,9 @@
         "scroll-into-view-if-needed": "^2.2.25",
         "@tntd/icons": "^1.0.10",
         "@ant-design/colors": "^3.1.0",
-        "rc-resize-observer": "~1.4.0"
+        "rc-resize-observer": "~1.4.0",
+        "react-resizable": "~3.0.4",
+        "@types/react-resizable": "~3.0.8"
     },
     "devDependencies": {
         "@react-types/shared": "^3.10.1",

package/es/tntd-virtual-tree-select/VirtualTree.js

@@ -1,125 +0,0 @@
-/*
- * @Descripttion: 最简单的tree下拉框，增加了虚拟滚动
- * @Author: 郑泳健
- * @Date: 2024-07-31 14:46:55
- * @LastEditors: 郑泳健
- * @LastEditTime: 2024-08-05 15:58:47
- */
-import React, { useState, useMemo, useEffect } from 'react';
-import List from 'rc-virtual-list';
-import Icon from '../icon';
-import Ellipsis from '../ellipsis';
-import Empty from '../empty';
-import Input from '../input';
-import { flatTreeData, getFullExpandedKeys, addTreeNodeKeys } from './utils';
-import './tree.less';
-const VirtualTree = ({
-  value,
-  onChange,
-  treeDefaultExpandAll,
-  fieldNames,
-  treeExpandedKeys,
-  showSearch,
-  treeData,
-  renderItem
-}) => {
-  const ref = React.useRef(null);
-  // 展开的节点列表
-  const [expandedKeys, setExpandedKeys] = useState([]);
-  const [choosedValue, setChoosedValue] = useState([]);
-  const [filterKey, setFilterKey] = useState(undefined);
-  useEffect(() => {
-    if (!['', null, undefined].includes(value)) {
-      setChoosedValue(value);
-    } else {
-      setChoosedValue(undefined);
-    }
-  }, [value]);
-  /** 给每个节点增加属性keys，值为其下面所有节点的集合 */
-  const treeDataWithKeys = useMemo(() => {
-    return addTreeNodeKeys(treeData, fieldNames);
-  }, [treeData, fieldNames]);
-  const mergeTreeDefaultExpandAll = useMemo(() => {
-    if (Array.isArray(treeExpandedKeys) && treeExpandedKeys.length) {
-      return false;
-    }
-    return treeDefaultExpandAll;
-  }, [treeDefaultExpandAll, treeExpandedKeys]);
-  /** 获取到所有展开的节点，因为treeDataWithKeys可能传入的是最后一级 */
-  useEffect(() => {
-    let transTreeExpandedKeys = Array.isArray(treeExpandedKeys) ? treeExpandedKeys : [];
-    if (value) {
-      transTreeExpandedKeys = [...treeExpandedKeys, value];
-    }
-    const _expandedKeys = getFullExpandedKeys(treeDataWithKeys, transTreeExpandedKeys, mergeTreeDefaultExpandAll);
-    setExpandedKeys(_expandedKeys);
-  }, [treeDataWithKeys, treeExpandedKeys, mergeTreeDefaultExpandAll, value]);
-  /** 最终渲染的数据 */
-  const renderData = useMemo(() => {
-    return flatTreeData(treeDataWithKeys, filterKey, expandedKeys);
-  }, [treeDataWithKeys, filterKey, expandedKeys]);
-  /** 切换展开/收起 */
-  const handleToggle = item => {
-    const {
-      value
-    } = item || {};
-    const bool = Array.isArray(expandedKeys) ? expandedKeys.includes(value) : false;
-    if (bool) {
-      const list = Array.isArray(expandedKeys) ? expandedKeys.filter(i => i !== value) : [];
-      setExpandedKeys(list);
-    } else {
-      setExpandedKeys([...expandedKeys, value]);
-    }
-  };
-  const defaultRenderItem = (item, expandedKeys) => {
-    return React.createElement(Ellipsis, {
-      title: item.title,
-      widthLimit: '100%'
-    });
-  };
-  const handleChange = _value => {
-    setChoosedValue(_value);
-    onChange === null || onChange === void 0 ? void 0 : onChange(_value);
-  };
-  const handleInput = e => {
-    const _filterValue = e.target.value;
-    setFilterKey(_filterValue);
-  };
-  return React.createElement("div", {
-    className: 'tntd-tree-select'
-  }, showSearch && Array.isArray(treeData) && !!treeData.length ? React.createElement(Input, {
-    onChange: handleInput,
-    allowClear: true
-  }) : '', !Array.isArray(renderData) || !renderData.length ? React.createElement(Empty, {
-    size: 'small'
-  }) : React.createElement(List, {
-    ref: ref,
-    height: 300,
-    itemHeight: 44,
-    data: renderData
-  }, item => {
-    const {
-      level,
-      children
-    } = item;
-    const bool = expandedKeys.includes(item.value);
-    return React.createElement("div", {
-      className: "tntd-tree-select-item",
-      style: {
-        paddingLeft: level * 18
-      }
-    }, React.createElement("div", {
-      style: {
-        width: 18,
-        paddingLeft: 3
-      }
-    }, Array.isArray(children) && !!children.length ? React.createElement(Icon, {
-      type: bool ? 'caret-down' : 'caret-right',
-      onClick: () => handleToggle(item)
-    }) : React.createElement(Icon, null)), React.createElement("div", {
-      className: `tntd-tree-select-item-title ${choosedValue === item.value ? 'tntd-tree-select-item-title_active' : ''}`,
-      onClick: () => handleChange(item.value)
-    }, renderItem ? renderItem(item, expandedKeys) : defaultRenderItem(item, expandedKeys)));
-  }));
-};
-export default VirtualTree;

package/es/tntd-virtual-tree-select/VirtualTree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"VirtualTree.js","sourceRoot":"","sources":["../../src/tntd-virtual-tree-select/VirtualTree.jsx"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,KAAK,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AAC5D,OAAO,IAAI,MAAM,iBAAiB,CAAC;AACnC,OAAO,IAAI,MAAM,SAAS,CAAA;AAC1B,OAAO,QAAQ,MAAM,aAAa,CAAC;AACnC,OAAO,KAAK,MAAM,UAAU,CAAC;AAC7B,OAAO,KAAK,MAAM,UAAU,CAAC;AAC7B,OAAO,EAAE,YAAY,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,aAAa,CAAA;AAEpB,MAAM,WAAW,GAAG,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,oBAAoB,EAAE,UAAU,EAAE,gBAAgB,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE;IAChI,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC9B,UAAU;IACV,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAA;IACpD,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAA;IACpD,MAAM,CAAC,SAAS,EAAE,YAAY,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAA;IAErD,SAAS,CAAC,GAAG,EAAE;QACb,IAAG,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YACzC,eAAe,CAAC,KAAK,CAAC,CAAA;SACvB;aAAK;YACJ,eAAe,CAAC,SAAS,CAAC,CAAA;SAC3B;IACH,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;IAEX,iCAAiC;IACjC,MAAM,gBAAgB,GAAG,OAAO,CAAC,GAAG,EAAE;QACpC,OAAO,eAAe,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAA;IAC9C,CAAC,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAA;IAE1B,MAAM,yBAAyB,GAAG,OAAO,CAAC,GAAG,EAAE;QAC7C,IAAG,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,gBAAgB,CAAC,MAAM,EAAE;YAC7D,OAAO,KAAK,CAAA;SACb;QAED,OAAO,oBAAoB,CAAA;IAC7B,CAAC,EAAE,CAAC,oBAAoB,EAAE,gBAAgB,CAAC,CAAC,CAAA;IAE5C,8CAA8C;IAC9C,SAAS,CAAC,GAAG,EAAE;QACb,IAAI,qBAAqB,GAAG,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAA;QACnF,IAAG,KAAK,EAAE;YACR,qBAAqB,GAAG,CAAC,GAAG,gBAAgB,EAAE,KAAK,CAAC,CAAA;SACrD;QACD,MAAM,aAAa,GAAG,mBAAmB,CAAC,gBAAgB,EAAE,qBAAqB,EAAE,yBAAyB,CAAC,CAAA;QAC7G,eAAe,CAAC,aAAa,CAAC,CAAA;IAChC,CAAC,EAAE,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,yBAAyB,EAAE,KAAK,CAAC,CAAC,CAAA;IAE1E,cAAc;IACd,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE;QAC9B,OAAO,YAAY,CAAC,gBAAgB,EAAE,SAAS,EAAE,YAAY,CAAC,CAAA;IAChE,CAAC,EAAE,CAAC,gBAAgB,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC,CAAA;IAE/C,cAAc;IACd,MAAM,YAAY,GAAG,CAAC,IAAI,EAAE,EAAE;QAC5B,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,IAAI,EAAE,CAAA;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAChF,IAAG,IAAI,EAAE;YACP,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YACrF,eAAe,CAAC,IAAI,CAAC,CAAA;SACtB;aAAK;YACJ,eAAe,CAAC,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,CAAC,CAAA;SAC1C;IACH,CAAC,CAAA;IAED,MAAM,iBAAiB,GAAG,CAAC,IAAI,EAAE,YAAY,EAAE,EAAE;QAC/C,OAAO,oBAAC,QAAQ,IAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,GAAI,CAAA;IAC5D,CAAC,CAAA;IAED,MAAM,YAAY,GAAG,CAAC,MAAM,EAAE,EAAE;QAC9B,eAAe,CAAC,MAAM,CAAC,CAAA;QACvB,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAG,MAAM,CAAC,CAAA;IACpB,CAAC,CAAA;IAED,MAAM,WAAW,GAAG,CAAC,CAAC,EAAE,EAAE;QACxB,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAA;QAEnC,YAAY,CAAC,YAAY,CAAC,CAAA;IAC5B,CAAC,CAAA;IAED,OAAO,CACL,6BAAK,SAAS,EAAC,kBAAkB;QAC9B,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,oBAAC,KAAK,IAAC,QAAQ,EAAE,WAAW,EAAE,UAAU,SAAG,CAAC,CAAC,CAAC,EAAE;QAE5G,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAClD,oBAAC,KAAK,IAAC,IAAI,EAAC,OAAO,GAAG,CAAC,CAAC;YACxB,oBAAC,IAAI,IACH,GAAG,EAAE,GAAG,EACR,MAAM,EAAE,GAAG,EACX,UAAU,EAAE,EAAE,EACd,IAAI,EAAE,UAAU,IAGd,CAAC,IAAI,EAAE,EAAE;gBACP,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;gBACjC,MAAM,IAAI,GAAG,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAC9C,OAAO,CACL,6BAAK,SAAS,EAAC,uBAAuB,EAClC,KAAK,EAAE,EAAE,WAAW,EAAE,KAAK,GAAG,EAAE,EAAE;oBAClC,6BAAK,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,IACtC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,oBAAC,IAAI,IAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,aAAa,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,GAAI,CAAC,CAAC,CAAC,oBAAC,IAAI,OAAG,CAC7I;oBAEN,6BACE,SAAS,EAAE,+BAA+B,YAAY,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,oCAAoC,CAAC,CAAC,CAAC,EAAG,EAAE,EACpH,OAAO,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,IAEtC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,CAChF,CACJ,CACP,CAAA;YACH,CAAC,CAEE,CAEL,CACP,CAAC;AACJ,CAAC,CAAC;AAEF,eAAe,WAAW,CAAA","sourcesContent":["/*\n * @Descripttion: 最简单的tree下拉框，增加了虚拟滚动\n * @Author: 郑泳健\n * @Date: 2024-07-31 14:46:55\n * @LastEditors: 郑泳健\n * @LastEditTime: 2024-08-05 15:58:47\n */\nimport React, { useState, useMemo, useEffect } from 'react';\nimport List from 'rc-virtual-list';\nimport Icon from '../icon'\nimport Ellipsis from '../ellipsis';\nimport Empty from '../empty';\nimport Input from '../input';\nimport { flatTreeData, getFullExpandedKeys, addTreeNodeKeys } from './utils';\nimport './tree.less'\n\nconst VirtualTree = ({ value, onChange, treeDefaultExpandAll, fieldNames, treeExpandedKeys, showSearch, treeData, renderItem }) => {\n  const ref = React.useRef(null)\n  // 展开的节点列表\n  const [expandedKeys, setExpandedKeys] = useState([])\n  const [choosedValue, setChoosedValue] = useState([])\n  const [filterKey, setFilterKey] = useState(undefined)\n\n  useEffect(() => {\n    if(!['', null, undefined].includes(value)) {\n      setChoosedValue(value)\n    }else {\n      setChoosedValue(undefined)\n    }\n  }, [value])\n\n  /** 给每个节点增加属性keys，值为其下面所有节点的集合 */\n  const treeDataWithKeys = useMemo(() => {\n    return addTreeNodeKeys(treeData, fieldNames)\n  }, [treeData, fieldNames])\n\n  const mergeTreeDefaultExpandAll = useMemo(() => {\n    if(Array.isArray(treeExpandedKeys) && treeExpandedKeys.length) {\n      return false\n    }\n\n    return treeDefaultExpandAll\n  }, [treeDefaultExpandAll, treeExpandedKeys])\n\n  /** 获取到所有展开的节点，因为treeDataWithKeys可能传入的是最后一级 */\n  useEffect(() => {\n    let transTreeExpandedKeys = Array.isArray(treeExpandedKeys) ? treeExpandedKeys : []\n    if(value) {\n      transTreeExpandedKeys = [...treeExpandedKeys, value]\n    }\n    const _expandedKeys = getFullExpandedKeys(treeDataWithKeys, transTreeExpandedKeys, mergeTreeDefaultExpandAll)\n    setExpandedKeys(_expandedKeys)\n  }, [treeDataWithKeys, treeExpandedKeys, mergeTreeDefaultExpandAll, value])\n\n  /** 最终渲染的数据 */\n  const renderData = useMemo(() => {\n    return flatTreeData(treeDataWithKeys, filterKey, expandedKeys)\n  }, [treeDataWithKeys, filterKey, expandedKeys])\n\n  /** 切换展开/收起 */\n  const handleToggle = (item) => {\n    const { value } = item || {}\n    const bool = Array.isArray(expandedKeys) ? expandedKeys.includes(value) : false;\n    if(bool) {\n      const list = Array.isArray(expandedKeys) ? expandedKeys.filter(i => i !== value) : []\n      setExpandedKeys(list)\n    }else {\n      setExpandedKeys([...expandedKeys, value])\n    }\n  }\n\n  const defaultRenderItem = (item, expandedKeys) => {\n    return <Ellipsis title={item.title} widthLimit={'100%'} />\n  }\n\n  const handleChange = (_value) => {\n    setChoosedValue(_value)\n    onChange?.(_value)\n  }\n\n  const handleInput = (e) => {\n    const _filterValue = e.target.value\n\n    setFilterKey(_filterValue)\n  }\n\n  return (\n    <div className='tntd-tree-select'>\n      {showSearch && Array.isArray(treeData) && !!treeData.length ? <Input onChange={handleInput} allowClear /> : ''}\n      {\n        !Array.isArray(renderData) || !renderData.length ? \n        <Empty size='small' /> :\n        <List\n          ref={ref}\n          height={300}\n          itemHeight={44}\n          data={renderData}\n        >\n          {\n            (item) => { \n              const { level, children } = item;\n              const bool = expandedKeys.includes(item.value)\n              return (\n                <div className=\"tntd-tree-select-item\"\n                    style={{ paddingLeft: level * 18 }}>\n                    <div style={{ width: 18, paddingLeft: 3 }}>\n                      {Array.isArray(children) && !!children.length ? <Icon type={bool ? 'caret-down' : 'caret-right'} onClick={() => handleToggle(item)} /> : <Icon />}\n                    </div>\n                   \n                    <div \n                      className={`tntd-tree-select-item-title ${choosedValue === item.value ? 'tntd-tree-select-item-title_active' : '' }`}\n                      onClick={() => handleChange(item.value)}\n                    >\n                      {renderItem ? renderItem(item, expandedKeys) : defaultRenderItem(item, expandedKeys)}\n                    </div>\n                </div>\n              )\n            }\n          }\n        </List>\n      }\n    </div>\n  );\n};\n\nexport default VirtualTree\n"]}

package/es/tntd-virtual-tree-select/tree.less

@@ -1,29 +0,0 @@
-.tntd-tree-select{
-  padding: 0;
-  white-space: nowrap;
-  .tntd-tree-select-item{
-    display: flex;
-    border-radius: var(--border-radius-sm);
-    color: #17233d;
-    text-decoration: none;
-    cursor: pointer;
-    line-height: 30px;
-    font-size: 14px;
-
-    .anticon-caret-down,.anticon-caret-right {
-      vertical-align: middle;
-      font-size: 12px;
-    }
-
-    .tntd-tree-select-item-title{
-      padding: 3px 5px;
-      flex: 1;
-      overflow: hidden;
-
-      &_active{
-        background-color: var(--blue-2);
-      }
-    }
-  }
-}
-

package/lib/tntd-virtual-tree-select/VirtualTree.d.ts

@@ -1,13 +0,0 @@
-export default VirtualTree;
-declare function VirtualTree({ value, onChange, treeDefaultExpandAll, fieldNames, treeExpandedKeys, showSearch, treeData, renderItem }: {
-    value: any;
-    onChange: any;
-    treeDefaultExpandAll: any;
-    fieldNames: any;
-    treeExpandedKeys: any;
-    showSearch: any;
-    treeData: any;
-    renderItem: any;
-}): React.JSX.Element;
-import React from "react";
-//# sourceMappingURL=VirtualTree.d.ts.map

package/lib/tntd-virtual-tree-select/VirtualTree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"VirtualTree.d.ts","sourceRoot":"","sources":["../../src/tntd-virtual-tree-select/VirtualTree.jsx"],"names":[],"mappings":";AAgBA;;;;;;;;;sBA2GC"}