| | |
| | | if (locDetls1.size() == 0) {//内侧库位没有相同的物料,跳过 |
| | | continue; |
| | | } |
| | | |
| | | int locRow = Utils.getRow(locDetl0.getLocNo()); |
| | | switch (locRow) { |
| | | case 3: |
| | | case 11: |
| | | case 18: |
| | | Collections.reverse(locDetls1); |
| | | break; |
| | | } |
| | | for (LocDetl detl : locDetls1) { |
| | | double lastCount = locDetl.getCount() - useCount;//剩余所需数量 |
| | | double realCount = 0;//实际提供数量 |
| | |
| | | double realCount = 0;//实际提供数量 |
| | | if (locDetl0.getAnfme() >= lastCount) {//实际数量大于所需数量,按所需数量提供 |
| | | realCount = lastCount; |
| | | }else { |
| | | } else { |
| | | //实际小于所需数量,按实际数量提供 |
| | | realCount = locDetl0.getAnfme(); |
| | | } |
| | |
| | | return locDetlList; |
| | | } |
| | | } |
| | | |
| | | //库存数量不满足 |
| | | throw new CoolException("单品区域只有" + useCount + "个货物"); |
| | | } |
| | | |
| | | return null; |
| | |
| | | assert ioType != null; |
| | | // 获取库位 |
| | | LocMast locMast = locMastService.selectById(dto.getLocNo()); |
| | | |
| | | //-----------------2023.6.2出库兼容代码----------------------- |
| | | List<LocDetl> locDetls = locDetlService.selectByLocNo(locMast.getLocNo()); |
| | | if (locMast.getLocType2() == 1 && locDetls.size() > 1) { |
| | | //单品区域出库物料大于1种,强制变成101全板出库 |
| | | ioType = 101; |
| | | } |
| | | //-----------------2023.6.2出库兼容代码end----------------------- |
| | | |
| | | // 获取路径 |
| | | StaDesc staDesc = staDescService.queryCrnStn(ioType, locMast.getCrnNo(), staNo.getDevNo(), locMast.getRow1()); |
| | | if(staDesc == null){ |