11wqe1 6 mēneši atpakaļ
vecāks
revīzija
72bd72eb3d

+ 22 - 1
src/components/easy2/commpont/markDialog.vue

@@ -770,7 +770,28 @@ export default {
               processedData[key] = value;
             });
 
-            // console.log(JSON.parse(JSON.stringify(processedData)));
+            console.log(JSON.parse(JSON.stringify(processedData)),this.scoTitList);
+
+            let IsAIsuccess = 0
+
+            for (const tKey in this.scoTitList) {
+              for (const key in processedData) {
+                let result = this.scoTitList[tKey].detail.match(/[\u4e00-\u9fa5a-zA-Z]+/g).join("");
+                let key2 = key.match(/[\u4e00-\u9fa5a-zA-Z]+/g).join("");
+                if (key != "评语") {
+                  if (result.indexOf(key2) != -1) {
+                     IsAIsuccess++
+                  }
+                  continue;
+                }
+              }
+              continue;
+            }
+            if (IsAIsuccess != this.scoTitList.length) {
+              _this.$message.error("评价失败");
+              _this.ScLoading = false;
+              return
+            }
 
             for (const key in processedData) {
               if (key == "评语") {

+ 22 - 0
src/components/easy2/commpont/markScore.vue

@@ -525,6 +525,28 @@ export default {
                 processedData[key] = value;
               });
 
+              let IsAIsuccess = 0
+
+              for (const tKey in this.scoTitList) {
+                for (const key in processedData) {
+                  let result = this.scoTitList[tKey].detail.match(/[\u4e00-\u9fa5a-zA-Z]+/g).join("");
+                  let key2 = key.match(/[\u4e00-\u9fa5a-zA-Z]+/g).join("");
+                  if (key != "评语") {
+                    if (result.indexOf(key2) != -1) {
+                      IsAIsuccess++
+                    }
+                    continue;
+                  }
+                }
+                continue;
+              }
+              if (IsAIsuccess != this.scoTitList.length) {
+                _this.$message.error("评价失败");
+                resolve(1);
+                return
+              }
+
+
               for (const key in processedData) {
                 // if (!Number.isFinite(processedData[key] * 1)) {
                 //   processedData[key] = 0;