Function showTreeValidationErrors

app/src/utils/treeValidation.tsx:9–76

(result: TreeValidationResult, type: "error" | "warning" = "error")

 * @param type 提示类型："error" | "warning"
 */
export function showTreeValidationErrors(result: TreeValidationResult, type: "error" | "warning" = "error"): void {
  if (result.issues.length === 0) return;

  // 按类型分组问题
  const issuesByType = new Map<string, typeof result.issues>();
  for (const issue of result.issues) {
    if (!issuesByType.has(issue.type)) {
      issuesByType.set(issue.type, []);
    }
    issuesByType.get(issue.type)!.push(issue);
  }

  // 构建错误消息
  const messages: string[] = [];
  messages.push("当前结构不符合树形结构:");

  // 1. 自环问题
  const selfLoopIssues = issuesByType.get("selfLoop");
  if (selfLoopIssues && selfLoopIssues.length > 0) {
    messages.push("");
    messages.push("• 存在自环:");
    for (const issue of selfLoopIssues) {
      messages.push(`  - ${issue.message}`);
    }
  }

  // 2. 边重叠问题
  const overlappingIssues = issuesByType.get("overlappingEdges");
  if (overlappingIssues && overlappingIssues.length > 0) {
    messages.push("");
    messages.push("• 存在重叠的边:");
    for (const issue of overlappingIssues) {
      messages.push(`  - ${issue.message}`);
    }
  }

  // 3. 环路问题
  const cycleIssues = issuesByType.get("cycle");
  if (cycleIssues && cycleIssues.length > 0) {
    messages.push("");
    messages.push("• 存在环路:");
    for (const issue of cycleIssues) {
      messages.push(`  - ${issue.message}`);
    }
  }

  // 4. 菱形结构问题
  const diamondIssues = issuesByType.get("diamond");
  if (diamondIssues && diamondIssues.length > 0) {
    messages.push("");
    messages.push("• 存在菱形结构（一个节点有多个父节点）:");
    for (const issue of diamondIssues) {
      messages.push(`  - ${issue.message}`);
    }
  }

  messages.push("");
  messages.push("请修复上述问题后再进行树形格式化。");