@kcuf/helper-tree 0.2.0 → 0.2.1

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

@@ -12,7 +12,7 @@ var _treeTrim = _interopRequireDefault(require("./tree-trim"));
  * 将平铺的（已标准化 `id` 和 `parentId`）数据转成树节点列表
  */
 function treeBuild(list) {
-  var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+  var maxLevel = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
   var nodeMap = new Map();
   var listClone = list.map(function (v) {
     var treeItem = (0, _objectSpread2.default)({}, v);
@@ -50,5 +50,5 @@ function treeBuild(list) {
       }
     });
   }
-  return depth > 0 ? (0, _treeTrim.default)(tree, depth) : tree;
+  return maxLevel > 0 ? (0, _treeTrim.default)(tree, maxLevel) : tree;
 }

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

@@ -4,8 +4,8 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = treeTrim;
-function treeTrimRecursive(tree, maxDepth, currentDepth) {
-  if (currentDepth >= maxDepth) {
+function treeTrimRecursive(tree, maxLevel, currentLevel) {
+  if (currentLevel >= maxLevel) {
     tree.forEach(function (node) {
       node.children = null;
       delete node.children;
@@ -15,18 +15,18 @@ function treeTrimRecursive(tree, maxDepth, currentDepth) {
   tree.forEach(function (node) {
     var _node$children;
     if ((_node$children = node.children) !== null && _node$children !== void 0 && _node$children.length) {
-      treeTrimRecursive(node.children, maxDepth, currentDepth + 1);
+      treeTrimRecursive(node.children, maxLevel, currentLevel + 1);
     }
   });
 }
 
 /**
- * 修建树到最大深度（注意，此方法会直接修改原树）
+ * 修建树（注意，此方法会直接修改原树）
  */
-function treeTrim(tree, maxDepth) {
-  if (maxDepth < 1) {
+function treeTrim(tree, maxLevel) {
+  if (maxLevel < 1) {
     return tree;
   }
-  treeTrimRecursive(tree, maxDepth, 0);
+  treeTrimRecursive(tree, maxLevel, 1);
   return tree;
 }

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

@@ -6,7 +6,7 @@ import treeTrim from './tree-trim';
  * 将平铺的（已标准化 `id` 和 `parentId`）数据转成树节点列表
  */
 export default function treeBuild(list) {
-  var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+  var maxLevel = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
   var nodeMap = new Map();
   var listClone = list.map(function (v) {
     var treeItem = _objectSpread({}, v);
@@ -44,6 +44,6 @@ export default function treeBuild(list) {
       }
     });
   }
-  return depth > 0 ? treeTrim(tree, depth) : tree;
+  return maxLevel > 0 ? treeTrim(tree, maxLevel) : tree;
 }
 //# sourceMappingURL=tree-build.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"tree-build.js","names":["treeFlatten","treeTrim","treeBuild","list","depth","arguments","length","undefined","nodeMap","Map","listClone","map","v","treeItem","_objectSpread","set","id","putToParent","o","parentNode","get","parentId","_parentNode$children","children","push","forEach","tree","filter","flatten","find","vv"],"sources":["../../../src/helper/tree-build.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem\n} from '../types';\n\nimport treeFlatten from './tree-flatten';\nimport treeTrim from './tree-trim';\n\n/**\n * 将平铺的（已标准化 `id` 和 `parentId`）数据转成树节点列表\n */\nexport default function treeBuild<T extends ITreeItemBase>(list: T[], depth = 0): 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 depth > 0 ? treeTrim(tree, depth) : tree;\n}\n"],"mappings":";AAKA,OAAOA,WAAW,MAAM,gBAAgB;AACxC,OAAOC,QAAQ,MAAM,aAAa;;AAElC;AACA;AACA;AACA,eAAe,SAASC,SAASA,CAA0BC,IAAS,EAA6B;EAAA,IAA3BC,KAAK,GAAAC,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC;EAC7E,IAAMG,OAAO,GAAG,IAAIC,GAAG,CAAuB,CAAC;EAC/C,IAAMC,SAAyB,GAAGP,IAAI,CAACQ,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,GAAG5B,WAAW,CAAC0B,IAAI,CAAC;EAEjC,IAAIE,OAAO,CAACtB,MAAM,KAAKH,IAAI,CAACG,MAAM,EAAE;IAAE;IACpCH,IAAI,CAACsB,OAAO,CAAC,UAAAb,CAAC,EAAI;MAChB,IAAI,CAACgB,OAAO,CAACC,IAAI,CAAC,UAAAC,EAAE;QAAA,OAAIA,EAAE,CAACd,EAAE,KAAKJ,CAAC,CAACI,EAAE;MAAA,EAAC,EAAE;QACvCU,IAAI,CAACF,IAAI,CAACZ,CAAC,CAAC;MACd;IACF,CAAC,CAAC;EACJ;EAEA,OAAOR,KAAK,GAAG,CAAC,GAAGH,QAAQ,CAACyB,IAAI,EAAEtB,KAAK,CAAC,GAAGsB,IAAI;AACjD","ignoreList":[]}
+{"version":3,"file":"tree-build.js","names":["treeFlatten","treeTrim","treeBuild","list","maxLevel","arguments","length","undefined","nodeMap","Map","listClone","map","v","treeItem","_objectSpread","set","id","putToParent","o","parentNode","get","parentId","_parentNode$children","children","push","forEach","tree","filter","flatten","find","vv"],"sources":["../../../src/helper/tree-build.ts"],"sourcesContent":["import {\n  ITreeItemBase,\n  TTreeItem\n} from '../types';\n\nimport treeFlatten from './tree-flatten';\nimport treeTrim from './tree-trim';\n\n/**\n * 将平铺的（已标准化 `id` 和 `parentId`）数据转成树节点列表\n */\nexport default function treeBuild<T extends ITreeItemBase>(list: T[], maxLevel = 0): 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 maxLevel > 0 ? treeTrim(tree, maxLevel) : tree;\n}\n"],"mappings":";AAKA,OAAOA,WAAW,MAAM,gBAAgB;AACxC,OAAOC,QAAQ,MAAM,aAAa;;AAElC;AACA;AACA;AACA,eAAe,SAASC,SAASA,CAA0BC,IAAS,EAAgC;EAAA,IAA9BC,QAAQ,GAAAC,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAE,SAAA,GAAAF,SAAA,MAAG,CAAC;EAChF,IAAMG,OAAO,GAAG,IAAIC,GAAG,CAAuB,CAAC;EAC/C,IAAMC,SAAyB,GAAGP,IAAI,CAACQ,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,GAAG5B,WAAW,CAAC0B,IAAI,CAAC;EAEjC,IAAIE,OAAO,CAACtB,MAAM,KAAKH,IAAI,CAACG,MAAM,EAAE;IAAE;IACpCH,IAAI,CAACsB,OAAO,CAAC,UAAAb,CAAC,EAAI;MAChB,IAAI,CAACgB,OAAO,CAACC,IAAI,CAAC,UAAAC,EAAE;QAAA,OAAIA,EAAE,CAACd,EAAE,KAAKJ,CAAC,CAACI,EAAE;MAAA,EAAC,EAAE;QACvCU,IAAI,CAACF,IAAI,CAACZ,CAAC,CAAC;MACd;IACF,CAAC,CAAC;EACJ;EAEA,OAAOR,QAAQ,GAAG,CAAC,GAAGH,QAAQ,CAACyB,IAAI,EAAEtB,QAAQ,CAAC,GAAGsB,IAAI;AACvD","ignoreList":[]}

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

@@ -1,5 +1,5 @@
-function treeTrimRecursive(tree, maxDepth, currentDepth) {
-  if (currentDepth >= maxDepth) {
+function treeTrimRecursive(tree, maxLevel, currentLevel) {
+  if (currentLevel >= maxLevel) {
     tree.forEach(function (node) {
       node.children = null;
       delete node.children;
@@ -9,19 +9,19 @@ function treeTrimRecursive(tree, maxDepth, currentDepth) {
   tree.forEach(function (node) {
     var _node$children;
     if ((_node$children = node.children) !== null && _node$children !== void 0 && _node$children.length) {
-      treeTrimRecursive(node.children, maxDepth, currentDepth + 1);
+      treeTrimRecursive(node.children, maxLevel, currentLevel + 1);
     }
   });
 }
 
 /**
- * 修建树到最大深度（注意，此方法会直接修改原树）
+ * 修建树（注意，此方法会直接修改原树）
  */
-export default function treeTrim(tree, maxDepth) {
-  if (maxDepth < 1) {
+export default function treeTrim(tree, maxLevel) {
+  if (maxLevel < 1) {
     return tree;
   }
-  treeTrimRecursive(tree, maxDepth, 0);
+  treeTrimRecursive(tree, maxLevel, 1);
   return tree;
 }
 //# sourceMappingURL=tree-trim.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"tree-trim.js","names":["treeTrimRecursive","tree","maxDepth","currentDepth","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>[], maxDepth: number, currentDepth: number): void {\n  if (currentDepth >= maxDepth) {\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, maxDepth, currentDepth + 1);\n    }\n  });\n}\n\n/**\n * 修建树到最大深度（注意，此方法会直接修改原树）\n */\nexport default function treeTrim<T extends ITreeItemBase>(tree: TTreeItem<T>[], maxDepth: number): TTreeItem<T>[] {\n  if (maxDepth < 1) {\n    return tree;\n  }\n  \n  treeTrimRecursive(tree, maxDepth, 0);\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","_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":[]}

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

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

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

@@ -1,5 +1,5 @@
 import { ITreeItemBase, TTreeItem } from '../types';
 /**
- * 修建树到最大深度（注意，此方法会直接修改原树）
+ * 修建树（注意，此方法会直接修改原树）
  */
-export default function treeTrim<T extends ITreeItemBase>(tree: TTreeItem<T>[], maxDepth: number): TTreeItem<T>[];
+export default function treeTrim<T extends ITreeItemBase>(tree: TTreeItem<T>[], maxLevel: number): TTreeItem<T>[];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@kcuf/helper-tree",
-  "version": "0.2.0",
+  "version": "0.2.1",
   "description": "The tree data helper.",
   "keywords": [],
   "license": "MIT",