在分配好的数据中找到了相同的头物料 且 数量差小于4,或者头物料行数量大于40的 分配到一组 头物料分组规则

main
768863620@qq.com 2025-02-13 15:29:09 +08:00
parent cf6afbae39
commit 5e81ab9ac8
1 changed files with 4 additions and 4 deletions

View File

@ -229,8 +229,8 @@ public class DefaultNewWaveManager extends DefaultBaseManager implements
+ touwuliao_map.get(twlKey).get(0).list.get(0).chf_fz; + touwuliao_map.get(twlKey).get(0).list.get(0).chf_fz;
int currCount_in = touwuliao_map.get(twlKey).get(0).hangshu; int currCount_in = touwuliao_map.get(twlKey).get(0).hangshu;
if (twl_in.equals(fenzu) if (twl_in.equals(fenzu)
&& Math.abs(currCount - currCount_in) <= 4) { && Math.abs(currCount - currCount_in) <= 4||Math.abs(currCount - currCount_in) >40) {
// 在分配好的数据中找到了相同的头物料 且 数量差小于4 // 在分配好的数据中找到了相同的头物料 且 数量差小于4 头物料分组规则
List<GongDanMingXi> old = touwuliao_map.get(twlKey); List<GongDanMingXi> old = touwuliao_map.get(twlKey);
old.add(gdPaiXu); old.add(gdPaiXu);
touwuliao_map.put(twlKey, old); touwuliao_map.put(twlKey, old);
@ -787,8 +787,8 @@ public class DefaultNewWaveManager extends DefaultBaseManager implements
+ touwuliao_map.get(twlKey).get(0).list.get(0).wllx; + touwuliao_map.get(twlKey).get(0).list.get(0).wllx;
int currCount_in = touwuliao_map.get(twlKey).get(0).hangshu; int currCount_in = touwuliao_map.get(twlKey).get(0).hangshu;
if (twl_in.equals(fenzu) if (twl_in.equals(fenzu)
&& Math.abs(currCount - currCount_in) <= 4) { && Math.abs(currCount - currCount_in) <= 4||Math.abs(currCount - currCount_in) >40) {
// 在分配好的数据中找到了相同的头物料 且 数量差小于4 // 在分配好的数据中找到了相同的头物料 且 数量差小于4 头物料分组规则
List<GongDanMingXi> old = touwuliao_map.get(twlKey); List<GongDanMingXi> old = touwuliao_map.get(twlKey);
old.add(gdPaiXu); old.add(gdPaiXu);
touwuliao_map.put(twlKey, old); touwuliao_map.put(twlKey, old);