gaodd před 5 roky
rodič
revize
aeb539cb8c

+ 32 - 19
src/main/java/com/unissoft/ventilation/service/impl/ProcessAuditServiceImpl.java

@@ -654,25 +654,38 @@ public class ProcessAuditServiceImpl extends ServiceImpl<ProcessAuditMapper, Pro
654 654
             if(list.size()>0){
655 655
             	 depot = list.get(0).getDepotId();
656 656
                  ongoingStep = Integer.valueOf(list.get(0).getOngoingStep());
657
-                if(list2.size()>0){
658
-                	 depot = list2.get(0).getDepotId();
659
-                     ongoingStep = Integer.valueOf(list2.get(0).getOngoingStep());
660
-                }
661
-        		
662
-                if(list.get(0).getResult() == 0){ //如果是多流程 则把审批数据分开
663
-                	int index = 0;
664
-                	for (int i = 0; i < list.size(); i++) {
665
-                    	if(list.get(i).getResult() == 1){
666
-                    		index = i;
667
-                    		break;
668
-                    	}
669
-            		}
670
-                	for (int i = 0; i < list.size(); i++) {
671
-						if( i >= index){
672
-							list2.add(list.get(i));
673
-						}
674
-					}
675
-                }
657
+                 
658
+                 //如果是多流程 则把审批数据分开
659
+                 QueryWrapper<ProcessAudit> ew1 = new QueryWrapper<>();
660
+                 ew1.eq("process_id", processId);
661
+                 ew1.eq("result", 1);
662
+                 List<ProcessAudit> list1 = processAuditMapper.selectList(ew1);
663
+                 if(list1.size()>1){ //多流程
664
+                	 QueryWrapper<ProcessAudit> ew2 = new QueryWrapper<>();
665
+                     ew2.eq("process_id", processId);
666
+                     ew2.eq("result", 1);
667
+                     ew2.eq("type", list1.get(1).getType());
668
+                     list2 = processAuditMapper.selectList(ew2);
669
+                	/*int index = 0;
670
+                	boolean flag = true;
671
+                 	for (int i = 0; i < list.size(); i++) {
672
+                     	if(list.get(i).getResult() == 1){
673
+                     		index = i;
674
+                     		flag = false;
675
+                     		break;
676
+                     	}
677
+             		}
678
+                 	for (int i = 0; i < list.size(); i++) {
679
+ 						if( i >= index){
680
+ 							list2.add(list.get(i));
681
+ 						}
682
+ 					}*/
683
+	                 if(list2.size()>0){
684
+	                	 depot = list2.get(0).getDepotId();
685
+	                     ongoingStep = Integer.valueOf(list2.get(0).getOngoingStep());
686
+	                 }
687
+                 }
688
+                	
676 689
             }
677 690
         }
678 691