Browse Source

简化排序代码

master
xyiege 3 years ago
parent
commit
58776c3511
  1. 23
      src/main/java/cn/chjyj/szwh/service/impl/GoodsServiceImpl.java

23
src/main/java/cn/chjyj/szwh/service/impl/GoodsServiceImpl.java

@ -465,24 +465,31 @@ public class GoodsServiceImpl implements GoodsService {
int ret = 0;
for(int i=0;i<tmpRanklist.size()-1;i++){
if(goodsIsli.equals(tmpRanklist.get(i).getGoodsIslicode()) ){
// 当前项目sort
int curSort = tmpRanklist.get(i).getRecommendSort();
// 上移
if(type==1) {
if(i==0){
break;
}else {
goodsMapper.updateRecommend(tmpRanklist.get(i-1).getGoodsIslicode(),
tmpRanklist.get(i).getRecommendSort());
ret = goodsMapper.updateRecommend(tmpRanklist.get(i).getGoodsIslicode(),
tmpRanklist.get(i-1).getRecommendSort());
//前序sort
int frontSort = tmpRanklist.get(i-1).getRecommendSort();
int afterSort= (frontSort==curSort)?curSort+1:frontSort;
// 前序变更recommend sort
goodsMapper.updateRecommend(tmpRanklist.get(i-1).getGoodsIslicode(),curSort);
ret = goodsMapper.updateRecommend(tmpRanklist.get(i).getGoodsIslicode(),afterSort);
}
}else{
if(i==tmpRanklist.size()-1){
break;
}else{
goodsMapper.updateRecommend(tmpRanklist.get(i+1).getGoodsIslicode(),
tmpRanklist.get(i).getRecommendSort());
ret = goodsMapper.updateRecommend(tmpRanklist.get(i).getGoodsIslicode(),
tmpRanklist.get(i+1).getRecommendSort());
//前序sort
int frontSort = tmpRanklist.get(i+1).getRecommendSort();
int afterSort= (frontSort==curSort)?curSort-1:frontSort;
goodsMapper.updateRecommend(tmpRanklist.get(i+1).getGoodsIslicode(),curSort);
ret = goodsMapper.updateRecommend(tmpRanklist.get(i).getGoodsIslicode(), afterSort);
}
}
}

Loading…
Cancel
Save