|
@ -211,7 +211,7 @@ public class YCLRKTask extends AbstractTask { |
|
|
//获取上次已分配的排数
|
|
|
//获取上次已分配的排数
|
|
|
Integer row = Integer.valueOf(now_yl_row.getValue()); |
|
|
Integer row = Integer.valueOf(now_yl_row.getValue()); |
|
|
//最多轮询7次map
|
|
|
//最多轮询7次map
|
|
|
int tryTime = rowist.size(); |
|
|
int tryTime = 7; |
|
|
while(tryTime>0){ |
|
|
while(tryTime>0){ |
|
|
row = row +1; |
|
|
row = row +1; |
|
|
if(row>7){ |
|
|
if(row>7){ |
|
@ -253,7 +253,7 @@ public class YCLRKTask extends AbstractTask { |
|
|
//获取上次已分配的排数
|
|
|
//获取上次已分配的排数
|
|
|
Integer row = Integer.valueOf(now_ylhc_row.getValue()); |
|
|
Integer row = Integer.valueOf(now_ylhc_row.getValue()); |
|
|
//最多轮询7次map
|
|
|
//最多轮询7次map
|
|
|
int tryTime = rowist.size(); |
|
|
int tryTime = 7; |
|
|
while(tryTime>0){ |
|
|
while(tryTime>0){ |
|
|
row = row +1; |
|
|
row = row +1; |
|
|
if(row>7){ |
|
|
if(row>7){ |
|
|