DeXun/klp-oa
9
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix(wms): 修正任务排序字段

Browse Source 
- 将任务排序字段从 "sequare" 修改为 "sequence"，以解决依赖关系构建错误的问题
- 此修改涉及三个不同的方法，确保所有相关逻辑使用正确的排序字段
This commit is contained in:
Joshi
2025-08-14 16:57:18 +08:00
parent de8099f9a8
commit 0b8a5cdc05
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
klp-wms/src/main/java/com/klp/service/impl/WmsBatchServiceImpl.java
View File

@@ -178,7 +178,7 @@ public class WmsBatchServiceImpl implements IWmsBatchService {
// 遍历每一行，记录每个进程在每一行的执行顺序 // 遍历每一行，记录每个进程在每一行的执行顺序
for (List<Map<String, Object>> row : rows) { for (List<Map<String, Object>> row : rows) {
// 按sequare排序 // 按sequare排序
row.sort(Comparator.comparingInt(task -> Integer.parseInt(task.get("sequare").toString()))); row.sort(Comparator.comparingInt(task -> Integer.parseInt(task.get("sequence").toString())));
// 记录每个进程的执行顺序 // 记录每个进程的执行顺序
for (int i = 0; i < row.size(); i++) { for (int i = 0; i < row.size(); i++) {
@@ -213,7 +213,7 @@ public class WmsBatchServiceImpl implements IWmsBatchService {
// 遍历每一行，记录进程间的依赖关系 // 遍历每一行，记录进程间的依赖关系
for (List<Map<String, Object>> row : rows) { for (List<Map<String, Object>> row : rows) {
// 按sequare排序 // 按sequare排序
row.sort(Comparator.comparingInt(task -> Integer.parseInt(task.get("sequare").toString()))); row.sort(Comparator.comparingInt(task -> Integer.parseInt(task.get("sequence").toString())));
// 构建依赖关系 // 构建依赖关系
for (int i = 0; i < row.size() - 1; i++) { for (int i = 0; i < row.size() - 1; i++) {
@@ -238,7 +238,7 @@ public class WmsBatchServiceImpl implements IWmsBatchService {
// 遍历每一行，记录任务间的依赖关系 // 遍历每一行，记录任务间的依赖关系
for (List<Map<String, Object>> row : rows) { for (List<Map<String, Object>> row : rows) {
// 按sequare排序 // 按sequare排序
row.sort(Comparator.comparingInt(task -> Integer.parseInt(task.get("sequare").toString()))); row.sort(Comparator.comparingInt(task -> Integer.parseInt(task.get("sequence").toString())));
// 构建依赖关系 // 构建依赖关系
for (int i = 0; i < row.size() - 1; i++) { for (int i = 0; i < row.size() - 1; i++) {