gtsoft/gtsoft-snail-job-server
1
0
Fork 0
Code Issues Pull Requests 1 Actions Packages Projects 1 Releases Wiki Activity

fix(sj_1.1.0-beta2): 修复reduce分片算法错误问题

Browse Source
This commit is contained in:
opensnail 2024-06-28 15:27:11 +08:00
parent d03ac24715
commit 6dae8aace5
1 changed files with 8 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
snail-job-server/snail-job-server-job-task/src/main/java/com/aizuda/snailjob/server/job/task/support/generator/task/MapReduceTaskGenerator.java
View File

@ -131,10 +131,15 @@ public class MapReduceTaskGenerator extends AbstractJobTaskGenerator {
.eq(JobTask::getLeaf, StatusEnum.YES.getStatus()) .eq(JobTask::getLeaf, StatusEnum.YES.getStatus())
); );
// 这里需要判断是否是map if (CollUtil.isEmpty(jobTasks)) {
List<String> allMapJobTasks = StreamUtils.toList(jobTasks, JobTask::getResultMessage); return Lists.newArrayList();
}
List<List<String>> partition = Lists.partition(allMapJobTasks, reduceParallel); // 这里需要判断是否是map
// 平均分配map集合, 若reduceParallel > allMapJobTasks.size(), 则取allMapJobTasks.size()作为分片数
List<String> allMapJobTasks = StreamUtils.toList(jobTasks, JobTask::getResultMessage);
int size = (allMapJobTasks.size() + reduceParallel - 1) / reduceParallel;
List<List<String>> partition = Lists.partition(allMapJobTasks, size);
jobTasks = new ArrayList<>(partition.size()); jobTasks = new ArrayList<>(partition.size());
final List<JobTask> finalJobTasks = jobTasks; final List<JobTask> finalJobTasks = jobTasks;