@kcuf/helper-tree 0.2.1 → 0.2.2

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

@@ -7,7 +7,7 @@ exports.default = treeTrim;
 function treeTrimRecursive(tree, maxLevel, currentLevel) {
   if (currentLevel >= maxLevel) {
     tree.forEach(function (node) {
-      node.children = null;
+      node.children = undefined;
       delete node.children;
     });
     return;

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

@@ -1,7 +1,7 @@
 function treeTrimRecursive(tree, maxLevel, currentLevel) {
   if (currentLevel >= maxLevel) {
     tree.forEach(function (node) {
-      node.children = null;
+      node.children = undefined;
       delete node.children;
     });
     return;

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

@@ -1 +1 @@
-{"version":3,"file":"tree-trim.js","names":["treeTrimRecursive","tree","maxLevel","currentLevel","forEach","node","children","_node$children","length","treeTrim"],"sources":["../../../src/helper/tree-trim.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem\n} from '../types';\n\nfunction treeTrimRecursive<T extends ITreeItemBase>(tree: TTreeItem<T>[], maxLevel: number, currentLevel: number): void {\n  if (currentLevel >= maxLevel) {\n    tree.forEach(node => {\n      node.children = null;\n      delete node.children;\n    });\n    \n    return;\n  }\n  \n  tree.forEach(node => {\n    if (node.children?.length) {\n      treeTrimRecursive(node.children, maxLevel, currentLevel + 1);\n    }\n  });\n}\n\n/**\n * 修建树（注意，此方法会直接修改原树）\n */\nexport default function treeTrim<T extends ITreeItemBase>(tree: TTreeItem<T>[], maxLevel: number): TTreeItem<T>[] {\n  if (maxLevel < 1) {\n    return tree;\n  }\n  \n  treeTrimRecursive(tree, maxLevel, 1);\n  \n  return tree;\n}\n"],"mappings":"AAKA,SAASA,iBAAiBA,CAA0BC,IAAoB,EAAEC,QAAgB,EAAEC,YAAoB,EAAQ;EACtH,IAAIA,YAAY,IAAID,QAAQ,EAAE;IAC5BD,IAAI,CAACG,OAAO,CAAC,UAAAC,IAAI,EAAI;MACnBA,IAAI,CAACC,QAAQ,GAAG,IAAI;MACpB,OAAOD,IAAI,CAACC,QAAQ;IACtB,CAAC,CAAC;IAEF;EACF;EAEAL,IAAI,CAACG,OAAO,CAAC,UAAAC,IAAI,EAAI;IAAA,IAAAE,cAAA;IACnB,KAAAA,cAAA,GAAIF,IAAI,CAACC,QAAQ,cAAAC,cAAA,eAAbA,cAAA,CAAeC,MAAM,EAAE;MACzBR,iBAAiB,CAACK,IAAI,CAACC,QAAQ,EAAEJ,QAAQ,EAAEC,YAAY,GAAG,CAAC,CAAC;IAC9D;EACF,CAAC,CAAC;AACJ;;AAEA;AACA;AACA;AACA,eAAe,SAASM,QAAQA,CAA0BR,IAAoB,EAAEC,QAAgB,EAAkB;EAChH,IAAIA,QAAQ,GAAG,CAAC,EAAE;IAChB,OAAOD,IAAI;EACb;EAEAD,iBAAiB,CAACC,IAAI,EAAEC,QAAQ,EAAE,CAAC,CAAC;EAEpC,OAAOD,IAAI;AACb","ignoreList":[]}
+{"version":3,"file":"tree-trim.js","names":["treeTrimRecursive","tree","maxLevel","currentLevel","forEach","node","children","undefined","_node$children","length","treeTrim"],"sources":["../../../src/helper/tree-trim.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem\n} from '../types';\n\nfunction treeTrimRecursive<T extends ITreeItemBase>(tree: TTreeItem<T>[], maxLevel: number, currentLevel: number): void {\n  if (currentLevel >= maxLevel) {\n    tree.forEach(node => {\n      node.children = undefined;\n      delete node.children;\n    });\n    \n    return;\n  }\n  \n  tree.forEach(node => {\n    if (node.children?.length) {\n      treeTrimRecursive(node.children, maxLevel, currentLevel + 1);\n    }\n  });\n}\n\n/**\n * 修建树（注意，此方法会直接修改原树）\n */\nexport default function treeTrim<T extends ITreeItemBase>(tree: TTreeItem<T>[], maxLevel: number): TTreeItem<T>[] {\n  if (maxLevel < 1) {\n    return tree;\n  }\n  \n  treeTrimRecursive(tree, maxLevel, 1);\n  \n  return tree;\n}\n"],"mappings":"AAKA,SAASA,iBAAiBA,CAA0BC,IAAoB,EAAEC,QAAgB,EAAEC,YAAoB,EAAQ;EACtH,IAAIA,YAAY,IAAID,QAAQ,EAAE;IAC5BD,IAAI,CAACG,OAAO,CAAC,UAAAC,IAAI,EAAI;MACnBA,IAAI,CAACC,QAAQ,GAAGC,SAAS;MACzB,OAAOF,IAAI,CAACC,QAAQ;IACtB,CAAC,CAAC;IAEF;EACF;EAEAL,IAAI,CAACG,OAAO,CAAC,UAAAC,IAAI,EAAI;IAAA,IAAAG,cAAA;IACnB,KAAAA,cAAA,GAAIH,IAAI,CAACC,QAAQ,cAAAE,cAAA,eAAbA,cAAA,CAAeC,MAAM,EAAE;MACzBT,iBAAiB,CAACK,IAAI,CAACC,QAAQ,EAAEJ,QAAQ,EAAEC,YAAY,GAAG,CAAC,CAAC;IAC9D;EACF,CAAC,CAAC;AACJ;;AAEA;AACA;AACA;AACA,eAAe,SAASO,QAAQA,CAA0BT,IAAoB,EAAEC,QAAgB,EAAkB;EAChH,IAAIA,QAAQ,GAAG,CAAC,EAAE;IAChB,OAAOD,IAAI;EACb;EAEAD,iBAAiB,CAACC,IAAI,EAAEC,QAAQ,EAAE,CAAC,CAAC;EAEpC,OAAOD,IAAI;AACb","ignoreList":[]}

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

@@ -1 +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>[] | null;\n};\n\n/**\n * 禁用树节点的模式\n *\n * - only - 仅禁用指定的节点\n * - downward - 向下级联，父节点被禁用，其所有子孙节点也自动标记\n * - upward - 向上级联，当所有子节点被禁用，其所有祖先节点也自动标记\n */\nexport type TTreeDisableMode = 'only' | 'downward' | 'upward';\n"],"mappings":"","ignoreList":[]}
+{"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/types/index.d.ts

@@ -4,7 +4,7 @@ export interface ITreeItemBase {
 }
 export type TTreeItem<T extends ITreeItemBase> = T & {
     disabled?: boolean;
-    children?: TTreeItem<T>[] | null;
+    children?: TTreeItem<T>[];
 };
 /**
  * 禁用树节点的模式

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@kcuf/helper-tree",
-  "version": "0.2.1",
+  "version": "0.2.2",
   "description": "The tree data helper.",
   "keywords": [],
   "license": "MIT",
@@ -27,10 +27,10 @@
     "@babel/plugin-transform-runtime": "^7.29.0",
     "@babel/preset-env": "^7.29.2",
     "@babel/preset-typescript": "^7.28.5",
-    "@vitest/coverage-v8": "^4.1.2",
+    "@vitest/coverage-v8": "^4.1.3",
     "rimraf": "^6.1.3",
     "typescript": "^6.0.2",
-    "vitest": "^4.1.2",
+    "vitest": "^4.1.3",
     "@kcuf/ts-config": "^0.2.0"
   },
   "peerDependencies": {