fix(接口自动化): #1006462 使用两层事务控制器，内层事务控制器下复制或引用的场景在报告中查看不了具体内容

【【github#6014】使用两层事务控制器，内层事务控制器下复制或引用的场景在报告中查看不了具体内容】https://www.tapd.cn/55049933/bugtrace/bugs/view?bug_id=1155049933001006462

frontend/src/business/components/api/automation/report/ApiReportDetail.vue

@@ -147,10 +147,18 @@ export default {
             label: nodeArray[i],
             value: item,
           };
+
           if (i !== nodeArray.length) {
             node.children = [];
           }
+          if(item.subRequestResults && item.subRequestResults.length > 0){
+            let itemChildren = this.deepFormatTreeNode(item.subRequestResults);
+            node.children = itemChildren;
 
+            if (node.label.indexOf("UUID=")) {
+              node.label = node.label.split("UUID=")[0];
+            }
+          }
           if (children.length === 0) {
             children.push(node);
           }
@@ -205,6 +213,95 @@ export default {
         }
       })
     },
+
+    deepFormatTreeNode(array) {
+      let children = [];
+      array.map((item) => {
+        let key = item.name;
+        let nodeArray = key.split('^@~@^');
+        //运行场景中如果连续将1个场景引入多次，会出现运行结果合并的情况。
+        //为了解决这种问题，在转hashTree的时候给场景放了个新ID，前台加载解析的时候也要做处理
+        let scenarioId = "";
+        let scenarioName = "";
+        if (item.scenario) {
+          let scenarioArr = JSON.parse(item.scenario);
+          if (scenarioArr.length > 1) {
+            let scenarioIdArr = scenarioArr[0].split("_");
+            scenarioId = scenarioIdArr[0];
+            scenarioName = scenarioIdArr[1];
+          }
+        }
+        // 循环构建子节点
+        for (let i = 0; i < nodeArray.length; i++) {
+          if (!nodeArray[i]) {
+            continue;
+          }
+          let node = {
+            label: nodeArray[i],
+            value: item,
+          };
+          if (i !== nodeArray.length) {
+            node.children = [];
+          }
+          if(item.subRequestResults && item.subRequestResults.length > 0){
+            let itemChildren = this.deepFormatTreeNode(item.subRequestResults);
+            node.children = itemChildren;
+          }
+          if (children.length === 0) {
+            children.push(node);
+          }
+
+          let isExist = false;
+          for (let j in children) {
+            if (children[j].label === node.label) {
+
+              let idIsPath = true;
+              //判断ID是否匹配  目前发现问题的只有重复场景，而重复场景是在第二个节点开始合并的。所以这里暂时只判断第二个场景问题。
+              //如果出现了其他问题，则需要检查其他问题的数据结构。暂时采用具体问题具体分析的策略
+              if (i === nodeArray.length - 2) {
+                idIsPath = false;
+                let childId = "";
+                let childName = "";
+                if (children[j].value && children[j].value.scenario) {
+                  let scenarioArr = JSON.parse(children[j].value.scenario);
+                  if (scenarioArr.length > 1) {
+                    let childArr = scenarioArr[0].split("_");
+                    childId = childArr[0];
+                    if (childArr.length > 1) {
+                      childName = childArr[1];
+                    }
+                  }
+                }
+                if (scenarioId === "") {
+                  idIsPath = true;
+                } else if (scenarioId === childId) {
+                  idIsPath = true;
+                } else if (scenarioName !== childName) {
+                  //如果两个名字不匹配则默认通过，不匹配ID
+                  idIsPath = true;
+                }
+              }
+              if (idIsPath) {
+                if (i !== nodeArray.length - 1 && !children[j].children) {
+                  children[j].children = [];
+                }
+                children = (i === nodeArray.length - 1 ? children : children[j].children);
+                isExist = true;
+                break;
+              }
+            }
+          }
+          if (!isExist) {
+            children.push(node);
+            if (i !== nodeArray.length - 1 && !children[children.length - 1].children) {
+              children[children.length - 1].children = [];
+            }
+            children = (i === nodeArray.length - 1 ? children : children[children.length - 1].children);
+          }
+        }
+      });
+      return children;
+    },
     recursiveSorting(arr) {
       for (let i in arr) {
         if (arr[i]) {