| | |
|---|
| | | if (930 == request.getCell()) { |
|---|
| | | Map<Integer, List<HollowBigStorageCageDetails>> listMap = hollowBigStorageCageDetailsList.stream() |
|---|
| | | .collect(Collectors.groupingBy(HollowBigStorageCageDetails::getHollowSequence)); |
|---|
| | | List<List<HollowGlassQueueInfo>> disorderList = new ArrayList<>(); |
|---|
| | | for (Map.Entry<Integer, List<HollowBigStorageCageDetails>> entry : listMap.entrySet()) { |
|---|
| | | //创建队列接收不满足成对情况下：一对玻璃分几次上车的次序问题 |
|---|
| | | List<HollowGlassQueueInfo> tempList = new ArrayList<>(); |
|---|
| | |
|---|
| | | for (HollowBigStorageCageDetails item : reverse) { |
|---|
| | | remainWidth = remainWidth - (int) Math.max(item.getWidth(), item.getHeight()); |
|---|
| | | if (remainWidth < 0) { |
|---|
| | | hollowQueues.addAll(CollectionUtil.reverse(tempList)); |
|---|
| | | disorderList.add(CollectionUtil.reverse(tempList)); |
|---|
| | | tempList = new ArrayList<>(); |
|---|
| | | remainWidth = carWidth - (int) Math.max(item.getWidth(), item.getHeight()); |
|---|
| | | } |
|---|
| | |
|---|
| | | tempList.add(queueInfo); |
|---|
| | | remainWidth = remainWidth - glassGap; |
|---|
| | | } |
|---|
| | | hollowQueues.addAll(CollectionUtil.reverse(tempList)); |
|---|
| | | disorderList.add(CollectionUtil.reverse(tempList)); |
|---|
| | | HollowBigStorageCageDetails cageDetails = entry.getValue().get(0); |
|---|
| | | if (cageDetails.getIsPair() == 1) { |
|---|
| | | isPairCount = isPairCount - cageDetails.getTotalLayer(); |
|---|
| | |
|---|
| | | } |
|---|
| | | } |
|---|
| | | } |
|---|
| | | //防止玻璃中空线玻璃无序，将玻璃按照顺序重新排序 |
|---|
| | | Collections.sort(disorderList, (s1, s2) -> s1.get(0).getHollowSequence() - s2.get(0).getHollowSequence()); |
|---|
| | | for (List<HollowGlassQueueInfo> list : disorderList) { |
|---|
| | | hollowQueues.addAll(list); |
|---|
| | | } |
|---|
| | | } else { |
|---|
| | | loop: |
|---|
| | | for (HollowBigStorageCageDetails item : hollowBigStorageCageDetailsList) { |
|---|
