|
|
|
|
@ -117,29 +117,53 @@ public class BsAssignServiceImpl extends BaseServiceImpl<BsAssignMapper, BsAssig |
|
|
|
|
//单批面积下限
|
|
|
|
|
BigDecimal traversedSingleLowArea = traversed.getSingleDownArea(); |
|
|
|
|
// 核心判断:当前上限 是否在 已遍历数据的[下限, 上限]区间内
|
|
|
|
|
if((currentLowArea.compareTo(traversedLowerArea)>=0 && currentLowArea.compareTo(traversedUpperArea)<=0) |
|
|
|
|
if((currentLowArea.compareTo(traversedLowerArea)==1 && currentLowArea.compareTo(traversedUpperArea)==-1) |
|
|
|
|
|| (currentUpperArea.compareTo(traversedLowerArea)==1 && currentUpperArea.compareTo(traversedUpperArea)==-1)){ |
|
|
|
|
return R.fail("单面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if(currentLowArea.compareTo(traversedLowerArea)<=0 |
|
|
|
|
&& (currentUpperArea.compareTo(traversedLowerArea)>=0 && currentUpperArea.compareTo(traversedUpperArea)<=0)){ |
|
|
|
|
// if (currentUpperArea >= traversedLowerArea && currentUpperArea <= traversedUpperArea) {
|
|
|
|
|
// System.out.printf(
|
|
|
|
|
// "触发退出条件!当前数据%s的上限%.1f,落在已遍历数据%s的区间[%.1f, %.1f]内%n",
|
|
|
|
|
// current.getId(), currentUpperArea, traversed.getId(), traversedLowerArea, traversedUpperArea
|
|
|
|
|
// );
|
|
|
|
|
// foundLowMatch = true;
|
|
|
|
|
// 跳出内层循环
|
|
|
|
|
// break;
|
|
|
|
|
return R.fail("单面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// if(currentUpperArea.compareTo(traversedLowerArea)>=0 && currentUpperArea.compareTo(traversedUpperArea)<=0){
|
|
|
|
|
// return R.fail("单面积上限已存在,请检查数据");
|
|
|
|
|
// }
|
|
|
|
|
if((currentLowArea.compareTo(traversedLowerArea)>=0 && currentLowArea.compareTo(traversedUpperArea)<=0) |
|
|
|
|
&& currentUpperArea.compareTo(traversedUpperArea)>=0){ |
|
|
|
|
return R.fail("单面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if(currentLowArea.compareTo(traversedLowerArea)<=0 |
|
|
|
|
&& currentUpperArea.compareTo(traversedUpperArea)>=0){ |
|
|
|
|
return R.fail("单面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if(currentLowArea.compareTo(traversedLowerArea)==0 |
|
|
|
|
&& currentUpperArea.compareTo(traversedUpperArea)==0){ |
|
|
|
|
return R.fail("单面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if((singleLowArea.compareTo(traversedSingleLowArea)>=0 && singleLowArea.compareTo(traversedSingleUpArea)<=0) && |
|
|
|
|
(singleUpArea.compareTo(traversedSingleLowArea)>=0 && singleUpArea.compareTo(traversedSingleUpArea)<=0)){ |
|
|
|
|
if((singleLowArea.compareTo(traversedSingleLowArea)==1 && singleLowArea.compareTo(traversedSingleUpArea)==-1) || |
|
|
|
|
(singleUpArea.compareTo(traversedSingleLowArea)==1 && singleUpArea.compareTo(traversedSingleUpArea)==-1)){ |
|
|
|
|
return R.fail("单批面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// foundLowMatch = true;
|
|
|
|
|
// 跳出内层循环
|
|
|
|
|
// break;
|
|
|
|
|
if(singleLowArea.compareTo(traversedSingleLowArea)<=0 |
|
|
|
|
&& (singleUpArea.compareTo(traversedSingleLowArea)>=0 && singleUpArea.compareTo(traversedSingleUpArea)<=0)){ |
|
|
|
|
return R.fail("单批面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if((singleLowArea.compareTo(traversedSingleLowArea)>=0 && currentLowArea.compareTo(traversedSingleUpArea)<=0) |
|
|
|
|
&& singleUpArea.compareTo(traversedSingleUpArea)>=0){ |
|
|
|
|
return R.fail("单批面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if(singleLowArea.compareTo(traversedSingleLowArea)<=0 |
|
|
|
|
&& singleUpArea.compareTo(traversedSingleUpArea)>=0){ |
|
|
|
|
return R.fail("单批面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if(singleLowArea.compareTo(traversedSingleLowArea)==0 && |
|
|
|
|
singleUpArea.compareTo(traversedSingleUpArea)==0){ |
|
|
|
|
return R.fail("单批面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
@ -249,35 +273,55 @@ public class BsAssignServiceImpl extends BaseServiceImpl<BsAssignMapper, BsAssig |
|
|
|
|
//单批面积下限
|
|
|
|
|
BigDecimal traversedSingleLowArea = traversed.getSingleDownArea(); |
|
|
|
|
// 核心判断:当前上限 是否在 已遍历数据的[下限, 上限]区间内
|
|
|
|
|
if((currentLowArea.compareTo(traversedLowerArea)>=0 && currentLowArea.compareTo(traversedUpperArea)<=0) |
|
|
|
|
if((currentLowArea.compareTo(traversedLowerArea)==1 && currentLowArea.compareTo(traversedUpperArea)==-1) |
|
|
|
|
|| (currentUpperArea.compareTo(traversedLowerArea)==1 && currentUpperArea.compareTo(traversedUpperArea)==-1)){ |
|
|
|
|
return R.fail("单面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if(currentLowArea.compareTo(traversedLowerArea)<=0 |
|
|
|
|
&& (currentUpperArea.compareTo(traversedLowerArea)>=0 && currentUpperArea.compareTo(traversedUpperArea)<=0)){ |
|
|
|
|
// if (currentUpperArea >= traversedLowerArea && currentUpperArea <= traversedUpperArea) {
|
|
|
|
|
// System.out.printf(
|
|
|
|
|
// "触发退出条件!当前数据%s的上限%.1f,落在已遍历数据%s的区间[%.1f, %.1f]内%n",
|
|
|
|
|
// current.getId(), currentUpperArea, traversed.getId(), traversedLowerArea, traversedUpperArea
|
|
|
|
|
// );
|
|
|
|
|
// foundLowMatch = true;
|
|
|
|
|
// 跳出内层循环
|
|
|
|
|
// break;
|
|
|
|
|
return R.fail("单面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// if(currentUpperArea.compareTo(traversedLowerArea)>=0 && currentUpperArea.compareTo(traversedUpperArea)<=0){
|
|
|
|
|
// return R.fail("单面积上限已存在,请检查数据");
|
|
|
|
|
// }
|
|
|
|
|
if((currentLowArea.compareTo(traversedLowerArea)>=0 && currentLowArea.compareTo(traversedUpperArea)<=0) |
|
|
|
|
&& currentUpperArea.compareTo(traversedUpperArea)>=0){ |
|
|
|
|
return R.fail("单面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if((singleLowArea.compareTo(traversedSingleLowArea)>=0 && singleLowArea.compareTo(traversedSingleUpArea)<=0) && |
|
|
|
|
(singleUpArea.compareTo(traversedSingleLowArea)>=0 && singleUpArea.compareTo(traversedSingleUpArea)<=0)){ |
|
|
|
|
if(currentLowArea.compareTo(traversedLowerArea)<=0 |
|
|
|
|
&& currentUpperArea.compareTo(traversedUpperArea)>=0){ |
|
|
|
|
return R.fail("单面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if(currentLowArea.compareTo(traversedLowerArea)==0 |
|
|
|
|
&& currentUpperArea.compareTo(traversedUpperArea)==0){ |
|
|
|
|
return R.fail("单面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// foundLowMatch = true;
|
|
|
|
|
// 跳出内层循环
|
|
|
|
|
// break;
|
|
|
|
|
if((singleLowArea.compareTo(traversedSingleLowArea)==1 && singleLowArea.compareTo(traversedSingleUpArea)==-1) || |
|
|
|
|
(singleUpArea.compareTo(traversedSingleLowArea)==1 && singleUpArea.compareTo(traversedSingleUpArea)==-1)){ |
|
|
|
|
return R.fail("单批面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// if(singleUpArea.compareTo(traversedSingleLowArea)>=0 && singleUpArea.compareTo(traversedSingleUpArea)<=0){
|
|
|
|
|
// return R.fail("单批面积上限已存在,请检查数据");
|
|
|
|
|
// }
|
|
|
|
|
if(singleLowArea.compareTo(traversedSingleLowArea)<=0 |
|
|
|
|
&& (singleUpArea.compareTo(traversedSingleLowArea)>=0 && singleUpArea.compareTo(traversedSingleUpArea)<=0)){ |
|
|
|
|
return R.fail("单批面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if((singleLowArea.compareTo(traversedSingleLowArea)>=0 && currentLowArea.compareTo(traversedSingleUpArea)<=0) |
|
|
|
|
&& singleUpArea.compareTo(traversedSingleUpArea)>=0){ |
|
|
|
|
return R.fail("单批面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if(singleLowArea.compareTo(traversedSingleLowArea)<=0 |
|
|
|
|
&& singleUpArea.compareTo(traversedSingleUpArea)>=0){ |
|
|
|
|
return R.fail("单批面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if(singleLowArea.compareTo(traversedSingleLowArea)==0 && |
|
|
|
|
singleUpArea.compareTo(traversedSingleUpArea)==0){ |
|
|
|
|
return R.fail("单批面积上下限已存在,请检查数据"); |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
// 未匹配,将当前数据加入已遍历集合,继续下一条
|
|
|
|
|
traversedList.add(current); |
|
|
|
|
|