2024-10-28

treeToFlat(tree, parentKey = null, result = []) {
      for (let node of tree) {
        const newNode = { ...node, parentId: parentKey };
        result.push(newNode);
        if (node.children && node.children.length > 0) {
          this.treeToFlat(node.children, node.id, result);
        }
        delete newNode.children; // 删除节点的children属性
      }
      return result;
    },
    safeListToTree(items, parentId = null, currentDepth = 0) {
      if (currentDepth >= 30) {
        return []; // 达到最大深度，返回空数组
      }
      const rootItems = items.filter((item) => item.parentId === parentId);
      rootItems.forEach((item) => {
        item.children = this.safeListToTree(items, item.uuid, currentDepth + 1);
      });
      return rootItems;
    },