@kcuf/helper-tree 0.1.0

package/CHANGELOG.md

@@ -0,0 +1,5 @@
+# CHANGELOG
+
+## 0.1.0 2025/12/24 @驳是
+
+* FEAT born from helper-data

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2019 Alibaba Cloud
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,5 @@
+# @kcuf/helper-data
+
+将千奇百怪、随心所欲、虚头巴脑的后端数据中的字段、类型进行标准化的帮助类型及方法。
+
+不具业务向，只做通用的逻辑，业务代码可以扩展这个包。

package/dist/cjs/helper/index.js

@@ -0,0 +1,41 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "treeBuild", {
+  enumerable: true,
+  get: function get() {
+    return _treeBuild.default;
+  }
+});
+Object.defineProperty(exports, "treeDisable", {
+  enumerable: true,
+  get: function get() {
+    return _treeDisable.default;
+  }
+});
+Object.defineProperty(exports, "treeFilter", {
+  enumerable: true,
+  get: function get() {
+    return _treeFilter.default;
+  }
+});
+Object.defineProperty(exports, "treeFlatten", {
+  enumerable: true,
+  get: function get() {
+    return _treeFlatten.default;
+  }
+});
+Object.defineProperty(exports, "treeTraverse", {
+  enumerable: true,
+  get: function get() {
+    return _treeTraverse.default;
+  }
+});
+var _treeBuild = _interopRequireDefault(require("./tree-build"));
+var _treeDisable = _interopRequireDefault(require("./tree-disable"));
+var _treeFilter = _interopRequireDefault(require("./tree-filter"));
+var _treeFlatten = _interopRequireDefault(require("./tree-flatten"));
+var _treeTraverse = _interopRequireDefault(require("./tree-traverse"));

package/dist/cjs/helper/tree-build.js

@@ -0,0 +1,52 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = treeBuild;
+var _objectSpread2 = _interopRequireDefault(require("@babel/runtime/helpers/objectSpread2"));
+var _treeFlatten = _interopRequireDefault(require("./tree-flatten"));
+/**
+ * 将平铺的（已标准化 `id` 和 `parentId`）数据转成树节点列表
+ */
+function treeBuild(list) {
+  var nodeMap = new Map();
+  var listClone = list.map(function (v) {
+    var treeItem = (0, _objectSpread2.default)({}, v);
+    nodeMap.set(treeItem.id, treeItem);
+    return treeItem;
+  });
+  function putToParent(o) {
+    var parentNode = nodeMap.get(o.parentId);
+    if (parentNode) {
+      var _parentNode$children;
+      (_parentNode$children = parentNode.children) !== null && _parentNode$children !== void 0 ? _parentNode$children : parentNode.children = [];
+      parentNode.children.push(o);
+    } else {
+      o.parentId = ''; // wrong parent
+    }
+  }
+  listClone.forEach(function (v) {
+    if (v.parentId) {
+      putToParent(v);
+    }
+  });
+  var tree = listClone.filter(function (v) {
+    return !v.parentId;
+  }); // All top-level nodes
+
+  // 若数据有自循环，则自循环的将不会在以上得到的树里
+  var flatten = (0, _treeFlatten.default)(tree);
+  if (flatten.length !== list.length) {
+    // 说明有循环，循环的会游离在树之外，需要收回来
+    list.forEach(function (v) {
+      if (!flatten.find(function (vv) {
+        return vv.id === v.id;
+      })) {
+        tree.push(v);
+      }
+    });
+  }
+  return tree;
+}

package/dist/cjs/helper/tree-disable-mode-downward.js

@@ -0,0 +1,25 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = treeDisableModeDownward;
+var _objectSpread2 = _interopRequireDefault(require("@babel/runtime/helpers/objectSpread2"));
+function treeDisableModeDownward(tree, disabledSet) {
+  function processNode(node, parentDisabled) {
+    var _node$children;
+    var disabled = parentDisabled || disabledSet.has(node.id);
+    var processedChildren = (_node$children = node.children) === null || _node$children === void 0 ? void 0 : _node$children.map(function (child) {
+      return processNode(child, disabled);
+    });
+    return (0, _objectSpread2.default)((0, _objectSpread2.default)((0, _objectSpread2.default)({}, node), disabled ? {
+      disabled: true
+    } : {}), processedChildren !== null && processedChildren !== void 0 && processedChildren.length ? {
+      children: processedChildren
+    } : {});
+  }
+  return tree.map(function (node) {
+    return processNode(node, false);
+  });
+}

package/dist/cjs/helper/tree-disable-mode-only.js

@@ -0,0 +1,24 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = treeDisableModeOnly;
+var _objectSpread2 = _interopRequireDefault(require("@babel/runtime/helpers/objectSpread2"));
+function treeDisableModeOnly(tree, disabledSet) {
+  function processNode(node) {
+    var disabled = disabledSet.has(node.id);
+    var processedChildren = node.children ? node.children.map(function (child) {
+      return processNode(child);
+    }) : undefined;
+    return (0, _objectSpread2.default)((0, _objectSpread2.default)((0, _objectSpread2.default)({}, node), disabled ? {
+      disabled: true
+    } : {}), processedChildren !== null && processedChildren !== void 0 && processedChildren.length ? {
+      children: processedChildren
+    } : {});
+  }
+  return tree.map(function (node) {
+    return processNode(node);
+  });
+}

package/dist/cjs/helper/tree-disable-mode-upward.js

@@ -0,0 +1,56 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = treeDisableModeUpward;
+var _objectSpread2 = _interopRequireDefault(require("@babel/runtime/helpers/objectSpread2"));
+var _createForOfIteratorHelper2 = _interopRequireDefault(require("@babel/runtime/helpers/createForOfIteratorHelper"));
+function treeDisableModeUpward(tree, disabledSet) {
+  // 第一步：收集所有需要向上级联禁用的节点路径
+  var upwardDisabledSet = new Set(disabledSet);
+  function collectUpwardDisabled(node) {
+    var hasDisabledChild = disabledSet.has(node.id);
+    if (node.children) {
+      var _iterator = (0, _createForOfIteratorHelper2.default)(node.children),
+        _step;
+      try {
+        for (_iterator.s(); !(_step = _iterator.n()).done;) {
+          var child = _step.value;
+          if (collectUpwardDisabled(child)) {
+            hasDisabledChild = true;
+          }
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } finally {
+        _iterator.f();
+      }
+    }
+    if (hasDisabledChild) {
+      upwardDisabledSet.add(node.id);
+    }
+    return hasDisabledChild;
+  }
+  tree.forEach(function (node) {
+    return collectUpwardDisabled(node);
+  });
+
+  // 第二步：根据收集到的禁用节点集合标记树
+  function processNode(node) {
+    var _node$children;
+    var disabled = upwardDisabledSet.has(node.id);
+    var processedChildren = (_node$children = node.children) === null || _node$children === void 0 ? void 0 : _node$children.map(function (child) {
+      return processNode(child);
+    });
+    return (0, _objectSpread2.default)((0, _objectSpread2.default)((0, _objectSpread2.default)({}, node), disabled ? {
+      disabled: true
+    } : {}), processedChildren !== null && processedChildren !== void 0 && processedChildren.length ? {
+      children: processedChildren
+    } : {});
+  }
+  return tree.map(function (node) {
+    return processNode(node);
+  });
+}

package/dist/cjs/helper/tree-disable.js

@@ -0,0 +1,24 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = treeDisable;
+var _treeDisableModeOnly = _interopRequireDefault(require("./tree-disable-mode-only"));
+var _treeDisableModeDownward = _interopRequireDefault(require("./tree-disable-mode-downward"));
+var _treeDisableModeUpward = _interopRequireDefault(require("./tree-disable-mode-upward"));
+/**
+ * 禁用树节点
+ */
+function treeDisable(tree, disabledIds, mode) {
+  var disabledSet = new Set(disabledIds);
+  switch (mode) {
+    case 'downward':
+      return (0, _treeDisableModeDownward.default)(tree, disabledSet);
+    case 'upward':
+      return (0, _treeDisableModeUpward.default)(tree, disabledSet);
+    default:
+      return (0, _treeDisableModeOnly.default)(tree, disabledSet);
+  }
+}

package/dist/cjs/helper/tree-filter.js

@@ -0,0 +1,42 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = treeFilter;
+var _objectSpread2 = _interopRequireDefault(require("@babel/runtime/helpers/objectSpread2"));
+var _objectWithoutProperties2 = _interopRequireDefault(require("@babel/runtime/helpers/objectWithoutProperties"));
+var _excluded = ["children"];
+/**
+ * 过滤树节点
+ *
+ * 策略：如果节点本身满足条件，或其任一子孙节点满足条件，则保留该节点及其满足条件的子树，以保留完整的父子路径，适用于搜索等场景
+ */
+function treeFilter(tree, predicate) {
+  function doFilter(node) {
+    var _node$children;
+    var matched = predicate(node);
+    // 递归过滤子节点
+    var filteredChildren = (_node$children = node.children) === null || _node$children === void 0 ? void 0 : _node$children.map(function (v) {
+      return doFilter(v);
+    }).filter(function (child) {
+      return child !== null;
+    });
+
+    // 如果节点本身满足条件，或者有过滤后的子节点，则保留该节点
+    if (matched || filteredChildren !== null && filteredChildren !== void 0 && filteredChildren.length) {
+      var _ = node.children,
+        nodeWithoutChildren = (0, _objectWithoutProperties2.default)(node, _excluded);
+      return (0, _objectSpread2.default)((0, _objectSpread2.default)({}, nodeWithoutChildren), filteredChildren !== null && filteredChildren !== void 0 && filteredChildren.length ? {
+        children: filteredChildren
+      } : {});
+    }
+    return null; // 否则移除节点
+  }
+  return tree.map(function (node) {
+    return doFilter(node);
+  }).filter(function (node) {
+    return node !== null;
+  });
+}

package/dist/cjs/helper/tree-flatten.js

@@ -0,0 +1,19 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = treeFlatten;
+var _objectWithoutProperties2 = _interopRequireDefault(require("@babel/runtime/helpers/objectWithoutProperties"));
+var _treeTraverse = _interopRequireDefault(require("./tree-traverse"));
+var _excluded = ["children"];
+function treeFlatten(tree) {
+  var result = [];
+  (0, _treeTraverse.default)(tree, function (v) {
+    var children = v.children,
+      flatNode = (0, _objectWithoutProperties2.default)(v, _excluded);
+    result.push(flatNode);
+  });
+  return result;
+}

package/dist/cjs/helper/tree-traverse.js

@@ -0,0 +1,18 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = treeTraverse;
+function treeTraverse(tree, callback) {
+  function traverse(nodes) {
+    nodes.forEach(function (v) {
+      var _v$children;
+      callback(v);
+      if ((_v$children = v.children) !== null && _v$children !== void 0 && _v$children.length) {
+        traverse(v.children);
+      }
+    });
+  }
+  traverse(tree);
+}

package/dist/cjs/index.js

@@ -0,0 +1,16 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _helper = require("./helper");
+Object.keys(_helper).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _helper[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function get() {
+      return _helper[key];
+    }
+  });
+});

package/dist/cjs/types/index.js

@@ -0,0 +1,5 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});

package/dist/esm/helper/index.js

@@ -0,0 +1,6 @@
+export { default as treeBuild } from './tree-build';
+export { default as treeDisable } from './tree-disable';
+export { default as treeFilter } from './tree-filter';
+export { default as treeFlatten } from './tree-flatten';
+export { default as treeTraverse } from './tree-traverse';
+//# sourceMappingURL=index.js.map

package/dist/esm/helper/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":["default","treeBuild","treeDisable","treeFilter","treeFlatten","treeTraverse"],"sources":["../../../src/helper/index.ts"],"sourcesContent":["export { default as treeBuild } from './tree-build';\nexport { default as treeDisable } from './tree-disable';\nexport { default as treeFilter } from './tree-filter';\nexport { default as treeFlatten } from './tree-flatten';\nexport { default as treeTraverse } from './tree-traverse';\n"],"mappings":"AAAA,SAASA,OAAO,IAAIC,SAAS,QAAQ,cAAc;AACnD,SAASD,OAAO,IAAIE,WAAW,QAAQ,gBAAgB;AACvD,SAASF,OAAO,IAAIG,UAAU,QAAQ,eAAe;AACrD,SAASH,OAAO,IAAII,WAAW,QAAQ,gBAAgB;AACvD,SAASJ,OAAO,IAAIK,YAAY,QAAQ,iBAAiB","ignoreList":[]}

package/dist/esm/helper/tree-build.js

@@ -0,0 +1,47 @@
+import _objectSpread from "@babel/runtime/helpers/objectSpread2";
+import treeFlatten from './tree-flatten';
+
+/**
+ * 将平铺的（已标准化 `id` 和 `parentId`）数据转成树节点列表
+ */
+export default function treeBuild(list) {
+  var nodeMap = new Map();
+  var listClone = list.map(function (v) {
+    var treeItem = _objectSpread({}, v);
+    nodeMap.set(treeItem.id, treeItem);
+    return treeItem;
+  });
+  function putToParent(o) {
+    var parentNode = nodeMap.get(o.parentId);
+    if (parentNode) {
+      var _parentNode$children;
+      (_parentNode$children = parentNode.children) !== null && _parentNode$children !== void 0 ? _parentNode$children : parentNode.children = [];
+      parentNode.children.push(o);
+    } else {
+      o.parentId = ''; // wrong parent
+    }
+  }
+  listClone.forEach(function (v) {
+    if (v.parentId) {
+      putToParent(v);
+    }
+  });
+  var tree = listClone.filter(function (v) {
+    return !v.parentId;
+  }); // All top-level nodes
+
+  // 若数据有自循环，则自循环的将不会在以上得到的树里
+  var flatten = treeFlatten(tree);
+  if (flatten.length !== list.length) {
+    // 说明有循环，循环的会游离在树之外，需要收回来
+    list.forEach(function (v) {
+      if (!flatten.find(function (vv) {
+        return vv.id === v.id;
+      })) {
+        tree.push(v);
+      }
+    });
+  }
+  return tree;
+}
+//# sourceMappingURL=tree-build.js.map

package/dist/esm/helper/tree-build.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-build.js","names":["treeFlatten","treeBuild","list","nodeMap","Map","listClone","map","v","treeItem","_objectSpread","set","id","putToParent","o","parentNode","get","parentId","_parentNode$children","children","push","forEach","tree","filter","flatten","length","find","vv"],"sources":["../../../src/helper/tree-build.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem\n} from '../types';\n\nimport treeFlatten from './tree-flatten';\n\n/**\n * 将平铺的（已标准化 `id` 和 `parentId`）数据转成树节点列表\n */\nexport default function treeBuild<T extends ITreeItemBase>(list: T[]): TTreeItem<T>[] {\n  const nodeMap = new Map<string, TTreeItem<T>>();\n  const listClone: TTreeItem<T>[] = list.map((v: T) => {\n    const treeItem: TTreeItem<T> = { // shallow clone\n      ...v\n    };\n    \n    nodeMap.set(treeItem.id, treeItem);\n    \n    return treeItem;\n  });\n  \n  function putToParent(o: TTreeItem<T>): void {\n    const parentNode = nodeMap.get(o.parentId);\n    \n    if (parentNode) {\n      parentNode.children ??= [];\n      parentNode.children.push(o);\n    } else {\n      o.parentId = ''; // wrong parent\n    }\n  }\n  \n  listClone.forEach(v => {\n    if (v.parentId) {\n      putToParent(v);\n    }\n  });\n  \n  const tree: TTreeItem<T>[] = listClone.filter(v => !v.parentId); // All top-level nodes\n  \n  // 若数据有自循环，则自循环的将不会在以上得到的树里\n  const flatten = treeFlatten(tree);\n  \n  if (flatten.length !== list.length) { // 说明有循环，循环的会游离在树之外，需要收回来\n    list.forEach(v => {\n      if (!flatten.find(vv => vv.id === v.id)) {\n        tree.push(v);\n      }\n    });\n  }\n  \n  return tree;\n}\n"],"mappings":";AAKA,OAAOA,WAAW,MAAM,gBAAgB;;AAExC;AACA;AACA;AACA,eAAe,SAASC,SAASA,CAA0BC,IAAS,EAAkB;EACpF,IAAMC,OAAO,GAAG,IAAIC,GAAG,CAAuB,CAAC;EAC/C,IAAMC,SAAyB,GAAGH,IAAI,CAACI,GAAG,CAAC,UAACC,CAAI,EAAK;IACnD,IAAMC,QAAsB,GAAAC,aAAA,KACvBF,CAAC,CACL;IAEDJ,OAAO,CAACO,GAAG,CAACF,QAAQ,CAACG,EAAE,EAAEH,QAAQ,CAAC;IAElC,OAAOA,QAAQ;EACjB,CAAC,CAAC;EAEF,SAASI,WAAWA,CAACC,CAAe,EAAQ;IAC1C,IAAMC,UAAU,GAAGX,OAAO,CAACY,GAAG,CAACF,CAAC,CAACG,QAAQ,CAAC;IAE1C,IAAIF,UAAU,EAAE;MAAA,IAAAG,oBAAA;MACd,CAAAA,oBAAA,GAAAH,UAAU,CAACI,QAAQ,cAAAD,oBAAA,cAAAA,oBAAA,GAAnBH,UAAU,CAACI,QAAQ,GAAK,EAAE;MAC1BJ,UAAU,CAACI,QAAQ,CAACC,IAAI,CAACN,CAAC,CAAC;IAC7B,CAAC,MAAM;MACLA,CAAC,CAACG,QAAQ,GAAG,EAAE,CAAC,CAAC;IACnB;EACF;EAEAX,SAAS,CAACe,OAAO,CAAC,UAAAb,CAAC,EAAI;IACrB,IAAIA,CAAC,CAACS,QAAQ,EAAE;MACdJ,WAAW,CAACL,CAAC,CAAC;IAChB;EACF,CAAC,CAAC;EAEF,IAAMc,IAAoB,GAAGhB,SAAS,CAACiB,MAAM,CAAC,UAAAf,CAAC;IAAA,OAAI,CAACA,CAAC,CAACS,QAAQ;EAAA,EAAC,CAAC,CAAC;;EAEjE;EACA,IAAMO,OAAO,GAAGvB,WAAW,CAACqB,IAAI,CAAC;EAEjC,IAAIE,OAAO,CAACC,MAAM,KAAKtB,IAAI,CAACsB,MAAM,EAAE;IAAE;IACpCtB,IAAI,CAACkB,OAAO,CAAC,UAAAb,CAAC,EAAI;MAChB,IAAI,CAACgB,OAAO,CAACE,IAAI,CAAC,UAAAC,EAAE;QAAA,OAAIA,EAAE,CAACf,EAAE,KAAKJ,CAAC,CAACI,EAAE;MAAA,EAAC,EAAE;QACvCU,IAAI,CAACF,IAAI,CAACZ,CAAC,CAAC;MACd;IACF,CAAC,CAAC;EACJ;EAEA,OAAOc,IAAI;AACb","ignoreList":[]}

package/dist/esm/helper/tree-disable-mode-downward.js

@@ -0,0 +1,19 @@
+import _objectSpread from "@babel/runtime/helpers/objectSpread2";
+export default function treeDisableModeDownward(tree, disabledSet) {
+  function processNode(node, parentDisabled) {
+    var _node$children;
+    var disabled = parentDisabled || disabledSet.has(node.id);
+    var processedChildren = (_node$children = node.children) === null || _node$children === void 0 ? void 0 : _node$children.map(function (child) {
+      return processNode(child, disabled);
+    });
+    return _objectSpread(_objectSpread(_objectSpread({}, node), disabled ? {
+      disabled: true
+    } : {}), processedChildren !== null && processedChildren !== void 0 && processedChildren.length ? {
+      children: processedChildren
+    } : {});
+  }
+  return tree.map(function (node) {
+    return processNode(node, false);
+  });
+}
+//# sourceMappingURL=tree-disable-mode-downward.js.map

package/dist/esm/helper/tree-disable-mode-downward.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-disable-mode-downward.js","names":["treeDisableModeDownward","tree","disabledSet","processNode","node","parentDisabled","_node$children","disabled","has","id","processedChildren","children","map","child","_objectSpread","length"],"sources":["../../../src/helper/tree-disable-mode-downward.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem\n} from '../types';\n\nexport default function treeDisableModeDownward<T extends ITreeItemBase>(tree: TTreeItem<T>[], disabledSet: Set<string>): TTreeItem<T>[] {\n  function processNode(node: TTreeItem<T>, parentDisabled: boolean): TTreeItem<T> {\n    const disabled = parentDisabled || disabledSet.has(node.id);\n    const processedChildren = node.children?.map(child => processNode(child, disabled));\n    \n    return {\n      ...node,\n      ...disabled ? {\n        disabled: true\n      } : {},\n      ...processedChildren?.length ? {\n        children: processedChildren\n      } : {}\n    };\n  }\n  \n  return tree.map(node => processNode(node, false));\n}\n"],"mappings":";AAKA,eAAe,SAASA,uBAAuBA,CAA0BC,IAAoB,EAAEC,WAAwB,EAAkB;EACvI,SAASC,WAAWA,CAACC,IAAkB,EAAEC,cAAuB,EAAgB;IAAA,IAAAC,cAAA;IAC9E,IAAMC,QAAQ,GAAGF,cAAc,IAAIH,WAAW,CAACM,GAAG,CAACJ,IAAI,CAACK,EAAE,CAAC;IAC3D,IAAMC,iBAAiB,IAAAJ,cAAA,GAAGF,IAAI,CAACO,QAAQ,cAAAL,cAAA,uBAAbA,cAAA,CAAeM,GAAG,CAAC,UAAAC,KAAK;MAAA,OAAIV,WAAW,CAACU,KAAK,EAAEN,QAAQ,CAAC;IAAA,EAAC;IAEnF,OAAAO,aAAA,CAAAA,aAAA,CAAAA,aAAA,KACKV,IAAI,GACJG,QAAQ,GAAG;MACZA,QAAQ,EAAE;IACZ,CAAC,GAAG,CAAC,CAAC,GACHG,iBAAiB,aAAjBA,iBAAiB,eAAjBA,iBAAiB,CAAEK,MAAM,GAAG;MAC7BJ,QAAQ,EAAED;IACZ,CAAC,GAAG,CAAC,CAAC;EAEV;EAEA,OAAOT,IAAI,CAACW,GAAG,CAAC,UAAAR,IAAI;IAAA,OAAID,WAAW,CAACC,IAAI,EAAE,KAAK,CAAC;EAAA,EAAC;AACnD","ignoreList":[]}

package/dist/esm/helper/tree-disable-mode-only.js

@@ -0,0 +1,18 @@
+import _objectSpread from "@babel/runtime/helpers/objectSpread2";
+export default function treeDisableModeOnly(tree, disabledSet) {
+  function processNode(node) {
+    var disabled = disabledSet.has(node.id);
+    var processedChildren = node.children ? node.children.map(function (child) {
+      return processNode(child);
+    }) : undefined;
+    return _objectSpread(_objectSpread(_objectSpread({}, node), disabled ? {
+      disabled: true
+    } : {}), processedChildren !== null && processedChildren !== void 0 && processedChildren.length ? {
+      children: processedChildren
+    } : {});
+  }
+  return tree.map(function (node) {
+    return processNode(node);
+  });
+}
+//# sourceMappingURL=tree-disable-mode-only.js.map

package/dist/esm/helper/tree-disable-mode-only.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-disable-mode-only.js","names":["treeDisableModeOnly","tree","disabledSet","processNode","node","disabled","has","id","processedChildren","children","map","child","undefined","_objectSpread","length"],"sources":["../../../src/helper/tree-disable-mode-only.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem\n} from '../types';\n\nexport default function treeDisableModeOnly<T extends ITreeItemBase>(tree: TTreeItem<T>[], disabledSet: Set<string>): TTreeItem<T>[] {\n  function processNode(node: TTreeItem<T>): TTreeItem<T> {\n    const disabled = disabledSet.has(node.id);\n    const processedChildren = node.children ? node.children.map(child => processNode(child)) : undefined;\n    \n    return {\n      ...node,\n      ...disabled ? {\n        disabled: true\n      } : {},\n      ...processedChildren?.length ? {\n        children: processedChildren\n      } : {}\n    };\n  }\n  \n  return tree.map(node => processNode(node));\n}\n"],"mappings":";AAKA,eAAe,SAASA,mBAAmBA,CAA0BC,IAAoB,EAAEC,WAAwB,EAAkB;EACnI,SAASC,WAAWA,CAACC,IAAkB,EAAgB;IACrD,IAAMC,QAAQ,GAAGH,WAAW,CAACI,GAAG,CAACF,IAAI,CAACG,EAAE,CAAC;IACzC,IAAMC,iBAAiB,GAAGJ,IAAI,CAACK,QAAQ,GAAGL,IAAI,CAACK,QAAQ,CAACC,GAAG,CAAC,UAAAC,KAAK;MAAA,OAAIR,WAAW,CAACQ,KAAK,CAAC;IAAA,EAAC,GAAGC,SAAS;IAEpG,OAAAC,aAAA,CAAAA,aAAA,CAAAA,aAAA,KACKT,IAAI,GACJC,QAAQ,GAAG;MACZA,QAAQ,EAAE;IACZ,CAAC,GAAG,CAAC,CAAC,GACHG,iBAAiB,aAAjBA,iBAAiB,eAAjBA,iBAAiB,CAAEM,MAAM,GAAG;MAC7BL,QAAQ,EAAED;IACZ,CAAC,GAAG,CAAC,CAAC;EAEV;EAEA,OAAOP,IAAI,CAACS,GAAG,CAAC,UAAAN,IAAI;IAAA,OAAID,WAAW,CAACC,IAAI,CAAC;EAAA,EAAC;AAC5C","ignoreList":[]}

package/dist/esm/helper/tree-disable-mode-upward.js

@@ -0,0 +1,50 @@
+import _objectSpread from "@babel/runtime/helpers/objectSpread2";
+import _createForOfIteratorHelper from "@babel/runtime/helpers/createForOfIteratorHelper";
+export default function treeDisableModeUpward(tree, disabledSet) {
+  // 第一步：收集所有需要向上级联禁用的节点路径
+  var upwardDisabledSet = new Set(disabledSet);
+  function collectUpwardDisabled(node) {
+    var hasDisabledChild = disabledSet.has(node.id);
+    if (node.children) {
+      var _iterator = _createForOfIteratorHelper(node.children),
+        _step;
+      try {
+        for (_iterator.s(); !(_step = _iterator.n()).done;) {
+          var child = _step.value;
+          if (collectUpwardDisabled(child)) {
+            hasDisabledChild = true;
+          }
+        }
+      } catch (err) {
+        _iterator.e(err);
+      } finally {
+        _iterator.f();
+      }
+    }
+    if (hasDisabledChild) {
+      upwardDisabledSet.add(node.id);
+    }
+    return hasDisabledChild;
+  }
+  tree.forEach(function (node) {
+    return collectUpwardDisabled(node);
+  });
+
+  // 第二步：根据收集到的禁用节点集合标记树
+  function processNode(node) {
+    var _node$children;
+    var disabled = upwardDisabledSet.has(node.id);
+    var processedChildren = (_node$children = node.children) === null || _node$children === void 0 ? void 0 : _node$children.map(function (child) {
+      return processNode(child);
+    });
+    return _objectSpread(_objectSpread(_objectSpread({}, node), disabled ? {
+      disabled: true
+    } : {}), processedChildren !== null && processedChildren !== void 0 && processedChildren.length ? {
+      children: processedChildren
+    } : {});
+  }
+  return tree.map(function (node) {
+    return processNode(node);
+  });
+}
+//# sourceMappingURL=tree-disable-mode-upward.js.map

package/dist/esm/helper/tree-disable-mode-upward.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-disable-mode-upward.js","names":["treeDisableModeUpward","tree","disabledSet","upwardDisabledSet","Set","collectUpwardDisabled","node","hasDisabledChild","has","id","children","_iterator","_createForOfIteratorHelper","_step","s","n","done","child","value","err","e","f","add","forEach","processNode","_node$children","disabled","processedChildren","map","_objectSpread","length"],"sources":["../../../src/helper/tree-disable-mode-upward.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem\n} from '../types';\n\nexport default function treeDisableModeUpward<T extends ITreeItemBase>(tree: TTreeItem<T>[], disabledSet: Set<string>): TTreeItem<T>[] {\n  // 第一步：收集所有需要向上级联禁用的节点路径\n  const upwardDisabledSet = new Set(disabledSet);\n  \n  function collectUpwardDisabled(node: TTreeItem<T>): boolean {\n    let hasDisabledChild = disabledSet.has(node.id);\n    \n    if (node.children) {\n      for (const child of node.children) {\n        if (collectUpwardDisabled(child)) {\n          hasDisabledChild = true;\n        }\n      }\n    }\n    \n    if (hasDisabledChild) {\n      upwardDisabledSet.add(node.id);\n    }\n    \n    return hasDisabledChild;\n  }\n  \n  tree.forEach(node => collectUpwardDisabled(node));\n  \n  // 第二步：根据收集到的禁用节点集合标记树\n  function processNode(node: TTreeItem<T>): TTreeItem<T> {\n    const disabled = upwardDisabledSet.has(node.id);\n    const processedChildren = node.children?.map(child => processNode(child));\n    \n    return {\n      ...node,\n      ...disabled ? {\n        disabled: true\n      } : {},\n      ...processedChildren?.length ? {\n        children: processedChildren\n      } : {}\n    };\n  }\n  \n  return tree.map(node => processNode(node));\n}\n"],"mappings":";;AAKA,eAAe,SAASA,qBAAqBA,CAA0BC,IAAoB,EAAEC,WAAwB,EAAkB;EACrI;EACA,IAAMC,iBAAiB,GAAG,IAAIC,GAAG,CAACF,WAAW,CAAC;EAE9C,SAASG,qBAAqBA,CAACC,IAAkB,EAAW;IAC1D,IAAIC,gBAAgB,GAAGL,WAAW,CAACM,GAAG,CAACF,IAAI,CAACG,EAAE,CAAC;IAE/C,IAAIH,IAAI,CAACI,QAAQ,EAAE;MAAA,IAAAC,SAAA,GAAAC,0BAAA,CACGN,IAAI,CAACI,QAAQ;QAAAG,KAAA;MAAA;QAAjC,KAAAF,SAAA,CAAAG,CAAA,MAAAD,KAAA,GAAAF,SAAA,CAAAI,CAAA,IAAAC,IAAA,GAAmC;UAAA,IAAxBC,KAAK,GAAAJ,KAAA,CAAAK,KAAA;UACd,IAAIb,qBAAqB,CAACY,KAAK,CAAC,EAAE;YAChCV,gBAAgB,GAAG,IAAI;UACzB;QACF;MAAC,SAAAY,GAAA;QAAAR,SAAA,CAAAS,CAAA,CAAAD,GAAA;MAAA;QAAAR,SAAA,CAAAU,CAAA;MAAA;IACH;IAEA,IAAId,gBAAgB,EAAE;MACpBJ,iBAAiB,CAACmB,GAAG,CAAChB,IAAI,CAACG,EAAE,CAAC;IAChC;IAEA,OAAOF,gBAAgB;EACzB;EAEAN,IAAI,CAACsB,OAAO,CAAC,UAAAjB,IAAI;IAAA,OAAID,qBAAqB,CAACC,IAAI,CAAC;EAAA,EAAC;;EAEjD;EACA,SAASkB,WAAWA,CAAClB,IAAkB,EAAgB;IAAA,IAAAmB,cAAA;IACrD,IAAMC,QAAQ,GAAGvB,iBAAiB,CAACK,GAAG,CAACF,IAAI,CAACG,EAAE,CAAC;IAC/C,IAAMkB,iBAAiB,IAAAF,cAAA,GAAGnB,IAAI,CAACI,QAAQ,cAAAe,cAAA,uBAAbA,cAAA,CAAeG,GAAG,CAAC,UAAAX,KAAK;MAAA,OAAIO,WAAW,CAACP,KAAK,CAAC;IAAA,EAAC;IAEzE,OAAAY,aAAA,CAAAA,aAAA,CAAAA,aAAA,KACKvB,IAAI,GACJoB,QAAQ,GAAG;MACZA,QAAQ,EAAE;IACZ,CAAC,GAAG,CAAC,CAAC,GACHC,iBAAiB,aAAjBA,iBAAiB,eAAjBA,iBAAiB,CAAEG,MAAM,GAAG;MAC7BpB,QAAQ,EAAEiB;IACZ,CAAC,GAAG,CAAC,CAAC;EAEV;EAEA,OAAO1B,IAAI,CAAC2B,GAAG,CAAC,UAAAtB,IAAI;IAAA,OAAIkB,WAAW,CAAClB,IAAI,CAAC;EAAA,EAAC;AAC5C","ignoreList":[]}

package/dist/esm/helper/tree-disable.js

@@ -0,0 +1,19 @@
+import treeDisableModeOnly from './tree-disable-mode-only';
+import treeDisableModeDownward from './tree-disable-mode-downward';
+import treeDisableModeUpward from './tree-disable-mode-upward';
+
+/**
+ * 禁用树节点
+ */
+export default function treeDisable(tree, disabledIds, mode) {
+  var disabledSet = new Set(disabledIds);
+  switch (mode) {
+    case 'downward':
+      return treeDisableModeDownward(tree, disabledSet);
+    case 'upward':
+      return treeDisableModeUpward(tree, disabledSet);
+    default:
+      return treeDisableModeOnly(tree, disabledSet);
+  }
+}
+//# sourceMappingURL=tree-disable.js.map

package/dist/esm/helper/tree-disable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-disable.js","names":["treeDisableModeOnly","treeDisableModeDownward","treeDisableModeUpward","treeDisable","tree","disabledIds","mode","disabledSet","Set"],"sources":["../../../src/helper/tree-disable.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem,\n  TTreeDisableMode\n} from '../types';\n\nimport treeDisableModeOnly from './tree-disable-mode-only';\nimport treeDisableModeDownward from './tree-disable-mode-downward';\nimport treeDisableModeUpward from './tree-disable-mode-upward';\n\n/**\n * 禁用树节点\n */\nexport default function treeDisable<T extends ITreeItemBase>(tree: TTreeItem<T>[], disabledIds: string[], mode?: TTreeDisableMode): TTreeItem<T>[] {\n  const disabledSet = new Set(disabledIds);\n  \n  switch (mode) {\n  case 'downward':\n    return treeDisableModeDownward(tree, disabledSet);\n  case 'upward':\n    return treeDisableModeUpward(tree, disabledSet);\n  default:\n    return treeDisableModeOnly(tree, disabledSet);\n  }\n}\n"],"mappings":"AAMA,OAAOA,mBAAmB,MAAM,0BAA0B;AAC1D,OAAOC,uBAAuB,MAAM,8BAA8B;AAClE,OAAOC,qBAAqB,MAAM,4BAA4B;;AAE9D;AACA;AACA;AACA,eAAe,SAASC,WAAWA,CAA0BC,IAAoB,EAAEC,WAAqB,EAAEC,IAAuB,EAAkB;EACjJ,IAAMC,WAAW,GAAG,IAAIC,GAAG,CAACH,WAAW,CAAC;EAExC,QAAQC,IAAI;IACZ,KAAK,UAAU;MACb,OAAOL,uBAAuB,CAACG,IAAI,EAAEG,WAAW,CAAC;IACnD,KAAK,QAAQ;MACX,OAAOL,qBAAqB,CAACE,IAAI,EAAEG,WAAW,CAAC;IACjD;MACE,OAAOP,mBAAmB,CAACI,IAAI,EAAEG,WAAW,CAAC;EAC/C;AACF","ignoreList":[]}

package/dist/esm/helper/tree-filter.js

@@ -0,0 +1,36 @@
+import _objectSpread from "@babel/runtime/helpers/objectSpread2";
+import _objectWithoutProperties from "@babel/runtime/helpers/objectWithoutProperties";
+var _excluded = ["children"];
+/**
+ * 过滤树节点
+ *
+ * 策略：如果节点本身满足条件，或其任一子孙节点满足条件，则保留该节点及其满足条件的子树，以保留完整的父子路径，适用于搜索等场景
+ */
+export default function treeFilter(tree, predicate) {
+  function doFilter(node) {
+    var _node$children;
+    var matched = predicate(node);
+    // 递归过滤子节点
+    var filteredChildren = (_node$children = node.children) === null || _node$children === void 0 ? void 0 : _node$children.map(function (v) {
+      return doFilter(v);
+    }).filter(function (child) {
+      return child !== null;
+    });
+
+    // 如果节点本身满足条件，或者有过滤后的子节点，则保留该节点
+    if (matched || filteredChildren !== null && filteredChildren !== void 0 && filteredChildren.length) {
+      var _ = node.children,
+        nodeWithoutChildren = _objectWithoutProperties(node, _excluded);
+      return _objectSpread(_objectSpread({}, nodeWithoutChildren), filteredChildren !== null && filteredChildren !== void 0 && filteredChildren.length ? {
+        children: filteredChildren
+      } : {});
+    }
+    return null; // 否则移除节点
+  }
+  return tree.map(function (node) {
+    return doFilter(node);
+  }).filter(function (node) {
+    return node !== null;
+  });
+}
+//# sourceMappingURL=tree-filter.js.map

package/dist/esm/helper/tree-filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-filter.js","names":["treeFilter","tree","predicate","doFilter","node","_node$children","matched","filteredChildren","children","map","v","filter","child","length","_","nodeWithoutChildren","_objectWithoutProperties","_excluded","_objectSpread"],"sources":["../../../src/helper/tree-filter.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem\n} from '../types';\n\n/**\n * 过滤树节点\n *\n * 策略：如果节点本身满足条件，或其任一子孙节点满足条件，则保留该节点及其满足条件的子树，以保留完整的父子路径，适用于搜索等场景\n */\nexport default function treeFilter<T extends ITreeItemBase>(tree: TTreeItem<T>[], predicate: (node: T) => boolean): TTreeItem<T>[] {\n  function doFilter(node: TTreeItem<T>): TTreeItem<T> | null {\n    const matched = predicate(node);\n    // 递归过滤子节点\n    const filteredChildren = node.children?.map(v => doFilter(v)).filter((child): child is TTreeItem<T> => child !== null);\n    \n    // 如果节点本身满足条件，或者有过滤后的子节点，则保留该节点\n    if (matched || filteredChildren?.length) {\n      const {\n        children: _,\n        ...nodeWithoutChildren\n      } = node;\n      \n      return {\n        ...nodeWithoutChildren as T,\n        ...filteredChildren?.length ? {\n          children: filteredChildren\n        } : {}\n      };\n    }\n    \n    return null; // 否则移除节点\n  }\n  \n  return tree.map(node => doFilter(node)).filter((node): node is TTreeItem<T> => node !== null);\n}\n"],"mappings":";;;AAKA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASA,UAAUA,CAA0BC,IAAoB,EAAEC,SAA+B,EAAkB;EACjI,SAASC,QAAQA,CAACC,IAAkB,EAAuB;IAAA,IAAAC,cAAA;IACzD,IAAMC,OAAO,GAAGJ,SAAS,CAACE,IAAI,CAAC;IAC/B;IACA,IAAMG,gBAAgB,IAAAF,cAAA,GAAGD,IAAI,CAACI,QAAQ,cAAAH,cAAA,uBAAbA,cAAA,CAAeI,GAAG,CAAC,UAAAC,CAAC;MAAA,OAAIP,QAAQ,CAACO,CAAC,CAAC;IAAA,EAAC,CAACC,MAAM,CAAC,UAACC,KAAK;MAAA,OAA4BA,KAAK,KAAK,IAAI;IAAA,EAAC;;IAEtH;IACA,IAAIN,OAAO,IAAIC,gBAAgB,aAAhBA,gBAAgB,eAAhBA,gBAAgB,CAAEM,MAAM,EAAE;MACvC,IACYC,CAAC,GAETV,IAAI,CAFNI,QAAQ;QACLO,mBAAmB,GAAAC,wBAAA,CACpBZ,IAAI,EAAAa,SAAA;MAER,OAAAC,aAAA,CAAAA,aAAA,KACKH,mBAAmB,GACnBR,gBAAgB,aAAhBA,gBAAgB,eAAhBA,gBAAgB,CAAEM,MAAM,GAAG;QAC5BL,QAAQ,EAAED;MACZ,CAAC,GAAG,CAAC,CAAC;IAEV;IAEA,OAAO,IAAI,CAAC,CAAC;EACf;EAEA,OAAON,IAAI,CAACQ,GAAG,CAAC,UAAAL,IAAI;IAAA,OAAID,QAAQ,CAACC,IAAI,CAAC;EAAA,EAAC,CAACO,MAAM,CAAC,UAACP,IAAI;IAAA,OAA2BA,IAAI,KAAK,IAAI;EAAA,EAAC;AAC/F","ignoreList":[]}

package/dist/esm/helper/tree-flatten.js

@@ -0,0 +1,13 @@
+import _objectWithoutProperties from "@babel/runtime/helpers/objectWithoutProperties";
+var _excluded = ["children"];
+import treeTraverse from './tree-traverse';
+export default function treeFlatten(tree) {
+  var result = [];
+  treeTraverse(tree, function (v) {
+    var children = v.children,
+      flatNode = _objectWithoutProperties(v, _excluded);
+    result.push(flatNode);
+  });
+  return result;
+}
+//# sourceMappingURL=tree-flatten.js.map

package/dist/esm/helper/tree-flatten.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-flatten.js","names":["treeTraverse","treeFlatten","tree","result","v","children","flatNode","_objectWithoutProperties","_excluded","push"],"sources":["../../../src/helper/tree-flatten.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem\n} from '../types';\n\nimport treeTraverse from './tree-traverse';\n\nexport default function treeFlatten<T extends ITreeItemBase>(tree: TTreeItem<T>[]): T[] {\n  const result: T[] = [];\n  \n  treeTraverse(tree, v => {\n    const {\n      children, // 剔除\n      ...flatNode\n    } = v;\n    \n    result.push(flatNode as T);\n  });\n  \n  return result;\n}\n"],"mappings":";;AAKA,OAAOA,YAAY,MAAM,iBAAiB;AAE1C,eAAe,SAASC,WAAWA,CAA0BC,IAAoB,EAAO;EACtF,IAAMC,MAAW,GAAG,EAAE;EAEtBH,YAAY,CAACE,IAAI,EAAE,UAAAE,CAAC,EAAI;IACtB,IACEC,QAAQ,GAEND,CAAC,CAFHC,QAAQ;MACLC,QAAQ,GAAAC,wBAAA,CACTH,CAAC,EAAAI,SAAA;IAELL,MAAM,CAACM,IAAI,CAACH,QAAa,CAAC;EAC5B,CAAC,CAAC;EAEF,OAAOH,MAAM;AACf","ignoreList":[]}

package/dist/esm/helper/tree-traverse.js

@@ -0,0 +1,13 @@
+export default function treeTraverse(tree, callback) {
+  function traverse(nodes) {
+    nodes.forEach(function (v) {
+      var _v$children;
+      callback(v);
+      if ((_v$children = v.children) !== null && _v$children !== void 0 && _v$children.length) {
+        traverse(v.children);
+      }
+    });
+  }
+  traverse(tree);
+}
+//# sourceMappingURL=tree-traverse.js.map

package/dist/esm/helper/tree-traverse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-traverse.js","names":["treeTraverse","tree","callback","traverse","nodes","forEach","v","_v$children","children","length"],"sources":["../../../src/helper/tree-traverse.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem\n} from '../types';\n\nexport default function treeTraverse<T extends ITreeItemBase>(tree: TTreeItem<T>[], callback: (o: TTreeItem<T>) => void): void {\n  function traverse(nodes: TTreeItem<T>[]): void {\n    nodes.forEach(v => {\n      callback(v);\n      \n      if (v.children?.length) {\n        traverse(v.children);\n      }\n    });\n  }\n  \n  traverse(tree);\n}\n"],"mappings":"AAKA,eAAe,SAASA,YAAYA,CAA0BC,IAAoB,EAAEC,QAAmC,EAAQ;EAC7H,SAASC,QAAQA,CAACC,KAAqB,EAAQ;IAC7CA,KAAK,CAACC,OAAO,CAAC,UAAAC,CAAC,EAAI;MAAA,IAAAC,WAAA;MACjBL,QAAQ,CAACI,CAAC,CAAC;MAEX,KAAAC,WAAA,GAAID,CAAC,CAACE,QAAQ,cAAAD,WAAA,eAAVA,WAAA,CAAYE,MAAM,EAAE;QACtBN,QAAQ,CAACG,CAAC,CAACE,QAAQ,CAAC;MACtB;IACF,CAAC,CAAC;EACJ;EAEAL,QAAQ,CAACF,IAAI,CAAC;AAChB","ignoreList":[]}

package/dist/esm/index.js

@@ -0,0 +1,3 @@
+export * from './helper';
+export {};
+//# sourceMappingURL=index.js.map

package/dist/esm/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../src/index.ts"],"sourcesContent":["export * from './helper';\n\nexport type {\n  ITreeItemBase as TreeItemBase,\n  TTreeItem as TreeItem,\n  TTreeDisableMode as TreeDisableMode\n} from './types';\n"],"mappings":"AAAA,cAAc,UAAU;AAAC","ignoreList":[]}

package/dist/esm/types/index.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=index.js.map

package/dist/esm/types/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../../src/types/index.ts"],"sourcesContent":["export interface ITreeItemBase {\n  id: string;\n  parentId: string;\n}\n\nexport type TTreeItem<T extends ITreeItemBase> = T & {\n  disabled?: boolean;\n  children?: TTreeItem<T>[];\n};\n\n/**\n * 禁用树节点的模式\n *\n * - only - 仅禁用指定的节点\n * - downward - 向下级联，父节点被禁用，其所有子孙节点也自动标记\n * - upward - 向上级联，当所有子节点被禁用，其所有祖先节点也自动标记\n */\nexport type TTreeDisableMode = 'only' | 'downward' | 'upward';\n"],"mappings":"","ignoreList":[]}

package/dist/types/helper/index.d.ts

@@ -0,0 +1,5 @@
+export { default as treeBuild } from './tree-build';
+export { default as treeDisable } from './tree-disable';
+export { default as treeFilter } from './tree-filter';
+export { default as treeFlatten } from './tree-flatten';
+export { default as treeTraverse } from './tree-traverse';

package/dist/types/helper/tree-build.d.ts

@@ -0,0 +1,5 @@
+import { ITreeItemBase, TTreeItem } from '../types';
+/**
+ * 将平铺的（已标准化 `id` 和 `parentId`）数据转成树节点列表
+ */
+export default function treeBuild<T extends ITreeItemBase>(list: T[]): TTreeItem<T>[];

package/dist/types/helper/tree-disable-mode-downward.d.ts

@@ -0,0 +1,2 @@
+import { ITreeItemBase, TTreeItem } from '../types';
+export default function treeDisableModeDownward<T extends ITreeItemBase>(tree: TTreeItem<T>[], disabledSet: Set<string>): TTreeItem<T>[];

package/dist/types/helper/tree-disable-mode-only.d.ts

@@ -0,0 +1,2 @@
+import { ITreeItemBase, TTreeItem } from '../types';
+export default function treeDisableModeOnly<T extends ITreeItemBase>(tree: TTreeItem<T>[], disabledSet: Set<string>): TTreeItem<T>[];

package/dist/types/helper/tree-disable-mode-upward.d.ts

@@ -0,0 +1,2 @@
+import { ITreeItemBase, TTreeItem } from '../types';
+export default function treeDisableModeUpward<T extends ITreeItemBase>(tree: TTreeItem<T>[], disabledSet: Set<string>): TTreeItem<T>[];

package/dist/types/helper/tree-disable.d.ts

@@ -0,0 +1,5 @@
+import { ITreeItemBase, TTreeItem, TTreeDisableMode } from '../types';
+/**
+ * 禁用树节点
+ */
+export default function treeDisable<T extends ITreeItemBase>(tree: TTreeItem<T>[], disabledIds: string[], mode?: TTreeDisableMode): TTreeItem<T>[];

package/dist/types/helper/tree-filter.d.ts

@@ -0,0 +1,7 @@
+import { ITreeItemBase, TTreeItem } from '../types';
+/**
+ * 过滤树节点
+ *
+ * 策略：如果节点本身满足条件，或其任一子孙节点满足条件，则保留该节点及其满足条件的子树，以保留完整的父子路径，适用于搜索等场景
+ */
+export default function treeFilter<T extends ITreeItemBase>(tree: TTreeItem<T>[], predicate: (node: T) => boolean): TTreeItem<T>[];

package/dist/types/helper/tree-flatten.d.ts

@@ -0,0 +1,2 @@
+import { ITreeItemBase, TTreeItem } from '../types';
+export default function treeFlatten<T extends ITreeItemBase>(tree: TTreeItem<T>[]): T[];

package/dist/types/helper/tree-traverse.d.ts

@@ -0,0 +1,2 @@
+import { ITreeItemBase, TTreeItem } from '../types';
+export default function treeTraverse<T extends ITreeItemBase>(tree: TTreeItem<T>[], callback: (o: TTreeItem<T>) => void): void;

package/dist/types/index.d.ts

@@ -0,0 +1,2 @@
+export * from './helper';
+export type { ITreeItemBase as TreeItemBase, TTreeItem as TreeItem, TTreeDisableMode as TreeDisableMode } from './types';

package/dist/types/types/index.d.ts

@@ -0,0 +1,16 @@
+export interface ITreeItemBase {
+    id: string;
+    parentId: string;
+}
+export type TTreeItem<T extends ITreeItemBase> = T & {
+    disabled?: boolean;
+    children?: TTreeItem<T>[];
+};
+/**
+ * 禁用树节点的模式
+ *
+ * - only - 仅禁用指定的节点
+ * - downward - 向下级联，父节点被禁用，其所有子孙节点也自动标记
+ * - upward - 向上级联，当所有子节点被禁用，其所有祖先节点也自动标记
+ */
+export type TTreeDisableMode = 'only' | 'downward' | 'upward';

package/package.json

@@ -0,0 +1,49 @@
+{
+  "name": "@kcuf/helper-tree",
+  "version": "0.1.0",
+  "description": "Tree data helper.",
+  "keywords": [],
+  "license": "MIT",
+  "sideEffects": false,
+  "main": "dist/cjs/index.js",
+  "module": "dist/esm/index.js",
+  "types": "dist/types/index.d.ts",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/justnewbee/kcuf.git"
+  },
+  "homepage": "https://github.com/justnewbee/kcuf/tree/main/packages-helper/helper-tree",
+  "bugs": "https://github.com/justnewbee/kcuf/issues",
+  "author": {
+    "name": "Jianchun Wang",
+    "email": "justnewbee@gmail.com"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "devDependencies": {
+    "@babel/cli": "^7.28.3",
+    "@babel/core": "^7.28.5",
+    "@babel/plugin-transform-runtime": "^7.28.5",
+    "@babel/preset-env": "^7.28.5",
+    "@babel/preset-typescript": "^7.28.5",
+    "@vitest/coverage-v8": "^4.0.16",
+    "rimraf": "^6.1.2",
+    "typescript": "^5.9.3",
+    "vitest": "^4.0.16",
+    "@kcuf/ts-config": "^0.1.0"
+  },
+  "peerDependencies": {
+    "@babel/runtime": ">=7.0.0"
+  },
+  "scripts": {
+    "build:clean": "rimraf dist",
+    "build:esm": "ESM=1 babel src -d dist/esm --extensions .ts,.tsx --source-maps",
+    "build:cjs": "ESM=0 babel src -d dist/cjs --extensions .ts,.tsx",
+    "build:types": "tsc -rootDir src --outDir dist/types --declaration --noEmit false --emitDeclarationOnly --isolatedModules false",
+    "build": "pnpm build:esm && pnpm build:cjs && pnpm build:types",
+    "watch": "pnpm build:esm -w",
+    "test": "vitest",
+    "test:cov": "vitest --coverage --coverage.include=src"
+  }
+}