test-version22
/
MeterSphere
mirror of https://gitee.com/fit2cloud-feizhiyun/MeterSphere.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

fix(测试计划): 修复导入数据缺少id导致的测试计划详情问题 

--bug=1040831 --user=王旭 【测试计划】计划详情-用例详情-待执行用例列表-切换已执行用例失败 https://www.tapd.cn/55049933/s/1518559
This commit is contained in:
WangXu10 2024-05-22 17:02:41 +08:00 committed by Craftsman
parent 00455b06a8
commit bdeabaf54b
2 changed files with 6 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
backend/services/case-management/src/main/java/io/metersphere/functional/excel/listener/FunctionalCaseCheckEventListener.java
View File

@ -256,7 +256,8 @@ public class FunctionalCaseCheckEventListener extends AnalysisEventListener<Map<
for (int i = 0; i < index; i++) { for (int i = 0; i < index; i++) {
// 保持插入顺序，判断用例是否有相同的steps // 保持插入顺序，判断用例是否有相同的steps
Map<String, Object> step = new LinkedHashMap<>(); Map<String, Object> step = new LinkedHashMap<>();
step.put("num", startStepIndex + i + 1); step.put("id", UUID.randomUUID().toString());
step.put("num", startStepIndex + i);
if (i < stepDescList.size()) { if (i < stepDescList.size()) {
step.put("desc", stepDescList.get(i)); step.put("desc", stepDescList.get(i));
if (stepDescList.get(i).length() > STEP_LENGTH) { if (stepDescList.get(i).length() > STEP_LENGTH) {

5
backend/services/case-management/src/main/java/io/metersphere/functional/excel/listener/FunctionalCaseImportEventListener.java
View File

@ -282,6 +282,8 @@ public class FunctionalCaseImportEventListener extends AnalysisEventListener<Map
} else { } else {
String steps = getSteps(functionalCaseExcelData); String steps = getSteps(functionalCaseExcelData);
functionalCaseExcelData.setSteps(steps); functionalCaseExcelData.setSteps(steps);
functionalCaseExcelData.setTextDescription(StringUtils.EMPTY);
functionalCaseExcelData.setExpectedResult(StringUtils.EMPTY);
} }
} }
@ -321,7 +323,8 @@ public class FunctionalCaseImportEventListener extends AnalysisEventListener<Map
for (int i = 0; i < index; i++) { for (int i = 0; i < index; i++) {
// 保持插入顺序，判断用例是否有相同的steps // 保持插入顺序，判断用例是否有相同的steps
Map<String, Object> step = new LinkedHashMap<>(); Map<String, Object> step = new LinkedHashMap<>();
step.put("num", startStepIndex + i + 1); step.put("id", UUID.randomUUID().toString());
step.put("num", startStepIndex + i );
if (i < stepDescList.size()) { if (i < stepDescList.size()) {
step.put("desc", stepDescList.get(i)); step.put("desc", stepDescList.get(i));
} else { } else {