From 4f171763ce5ee065a704e5d08fcbd5a3379dec85 Mon Sep 17 00:00:00 2001
From: 潘志宝 <979469083@qq.com>
Date: 星期三, 13 十一月 2024 14:22:31 +0800
Subject: [PATCH] 返回预测结果
---
iailab-module-model/iailab-module-model-biz/src/main/java/com/iailab/module/model/mcs/pre/service/impl/MmItemResultServiceImpl.java | 38 ++------------------------------------
1 files changed, 2 insertions(+), 36 deletions(-)
diff --git a/iailab-module-model/iailab-module-model-biz/src/main/java/com/iailab/module/model/mcs/pre/service/impl/MmItemResultServiceImpl.java b/iailab-module-model/iailab-module-model-biz/src/main/java/com/iailab/module/model/mcs/pre/service/impl/MmItemResultServiceImpl.java
index b69168a..03e3c52 100644
--- a/iailab-module-model/iailab-module-model-biz/src/main/java/com/iailab/module/model/mcs/pre/service/impl/MmItemResultServiceImpl.java
+++ b/iailab-module-model/iailab-module-model-biz/src/main/java/com/iailab/module/model/mcs/pre/service/impl/MmItemResultServiceImpl.java
@@ -75,9 +75,9 @@
List<DataValueVO> lastVoList = new ArrayList<>();
int size = entry.getValue().size();
- t = t > 0 ? t : 0;
+ t = Math.max(t, 0);
int n = "n".equals(nIndex) ? size : Integer.parseInt(nIndex);
- int length = (n - t) > 0 ? (n - t) : 0; //预测完不变的数据长度
+ int length = Math.max((n - t), 0); //预测完不变的数据长度
if (size >= n) {
for (int i = 0; i < (size - length); i ++) {
int index = length + i;
@@ -112,41 +112,7 @@
params.put("STARTTIME", importList.get(0).getDatatime());
params.put("ENDTIME", importList.get(importList.size() - 1).getDatatime());
mmItemResultDao.deletePredictValue(params);
-
-
}
-
-// Map<String, Object> params = new HashMap(4);
-// params.put("TABLENAME", T_MM_ITEM_RESULT);
-// params.put("OUTPUTID", importList.get(0).getOutputid());
-// params.put("STARTTIME", importList.get(0).getDatatime());
-// params.put("ENDTIME", importList.get(importList.size() - 1).getDatatime());
-// mmItemResultDao.deletePredictValue(params);
-
-// int num1 = importList.size() / max_group_count;
-// int num2 = importList.size() % max_group_count;
-// if (num2 != 0) {
-// num1++;
-// }
-//
-// List<MmItemResultEntity> tempList;
-// //先删除已经存在的数据，再插入新数据
-// for (int i = 0; i < num1; i++) {
-// int startIndex = max_group_count * i;
-// int count = max_group_count;
-// if (num2!=0 && i == num1 - 1) {
-// count = num2;
-// }
-// tempList = new ArrayList<>();
-// //获取某个索引范围内的对象集合
-// for (int j = startIndex; j < startIndex + count; j++) {
-// tempList.add(importList.get(j));
-// }
-// Map<String, Object> map2 = new HashMap<>(2);
-// map2.put("TABLENAME", T_MM_ITEM_RESULT);
-// map2.put("list", tempList);
-// mmItemResultDao.savePredictValue(map2);
-// }
mmItemResultDao.insertBatch(importList,max_group_count);
Map<String, Object> map3 = new HashMap<>(2);
--
Gitblit v1.9.3