Skip to content

Latest commit

 

History

History
114 lines (83 loc) · 3.53 KB

README.md

File metadata and controls

114 lines (83 loc) · 3.53 KB

@handsomewolf/tree-data

README | 中文文档

This npm package is named @handsomewolf/tree-data. It provides a series of features, such as basic conversion (converting tree structure to flat structure, converting flat structure data to tree structure), basic node operations (modifying tree nodes, inserting tree nodes, deleting tree nodes), basic queries (calculating tree depth and breadth, getting tree path, searching tree, getting subtree) and basic traversal (filtering tree, breadth-first traversal, depth-first traversal), etc.

Features

Install Dependencies

npm install @handsomewolf/tree-data

Usage

First, you need to import the TreeData class:

import { TreeData } from "@handsomewolf/tree-data";

Then, you can create a TreeData object:

const treeData = new TreeData(trees, options);

The TreeData constructor accepts two parameters:

  • trees: An array of objects, representing the tree structure data.
  • options: An optional configuration object, containing the following properties:
    • idKey: A string, representing the key of the id property in the node object, default is "id".
    • parentIdKey: A string, representing the key of the parent node id property in the node object, default is "parentId".
    • childrenKey: A string, representing the key of the children property in the node object, default is "children".

You can customize these key names by modifying the options parameter. For example:

const options = {
  idKey: 'myId',
  parentIdKey: 'myParentId',
  childrenKey: 'myChildren'
};

const treeData = new TreeData(trees, options);

Chaining

The instance methods of the TreeData class support chaining, which means you can link multiple operations together. For example:

import { TreeData } from "@handsomewolf/tree-data";

const trees = [
  {
    id: 1,
    children: [{ id: 3 }, { id: 2 }],
  },
  {
    id: 4,
    children: [{ id: 6 }, { id: 5 }],
  },
];

const treeData = new TreeData(trees);

treeData
  .sortNodes((a, b) => a.id - b.id)
  .filterTree({ exclude: { id: [3] } });

const result = treeData.getResult();
console.log(result);
// Output:
// [
//   {
//     id: 1,
//     children: [{ id: 2 }],
//   },
//   {
//     id: 4,
//     children: [{ id: 5 }, { id: 6 }],
//   },
// ]