Compare commits
No commits in common. "3fe0fe901d7bf75cdc400d2f1626becaad4f05b2" and "b65007b909fe9dae1b6eeabd53dfa7c801e7d9d4" have entirely different histories.
3fe0fe901d
...
b65007b909
|
|
@ -80,14 +80,11 @@ function getbaseList(init) {
|
|||
html += "<td style='vertical-align:middle;' class='center'>"+ JY.Object.notEmpty(l.nums) + "</td>";
|
||||
html += "<td style='vertical-align:middle;' class='center'>"+ JY.Object.notEmpty(l.checker) + "</td>";
|
||||
html += "<td style='vertical-align:middle;' class='center'>"+ JY.Object.notEmpty(l.customerRep) + "</td>";
|
||||
|
||||
if(l.isApproval==0 || l.isApproval=='0'){
|
||||
html += "<td style='vertical-align:middle;' class='center'><span style='color: red'>未批准</span></td>";
|
||||
}else{
|
||||
html += "<td style='vertical-align:middle;' class='center'><span style='clolr:green;'>已批准</span></td>";
|
||||
}
|
||||
html += "<td style='vertical-align:middle;' class='center'>"+ JY.Object.notEmpty(l.auditUser) + "</td>";
|
||||
html += "<td style='vertical-align:middle;' class='center'>"+ JY.Object.notEmpty(l.auditTime) + "</td>";
|
||||
html += rowFunction(l.taskId,l.maModelId,l.isApproval,l.nums,l.id);
|
||||
html += "</tr>";
|
||||
}
|
||||
|
|
|
|||
|
|
@ -192,10 +192,9 @@ public class NewSettlementService {
|
|||
Comparator.nullsFirst(Comparator.naturalOrder())));
|
||||
ProjectLeaseCostDetail firstItem = items.get(0);
|
||||
//
|
||||
if("612".equals(machineTypeId)) {
|
||||
if("1143".equals(machineTypeId)) {
|
||||
System.err.println(machineTypeId);
|
||||
}
|
||||
System.err.println(machineTypeId);
|
||||
double totalItemAmount = 0.0;
|
||||
//循环逻辑处理
|
||||
//默认在操作日期之前 存量
|
||||
|
|
@ -384,74 +383,48 @@ public class NewSettlementService {
|
|||
|
||||
}else {
|
||||
if(delNum>0) {
|
||||
if(fasetStarTime==null &¤tCount==0) {
|
||||
fasetStarTime=operateTime;
|
||||
currentCount=currentCount+addNum;
|
||||
// 然后将领取的座位最后一天单独计算
|
||||
double segmentAmount2 = currentCount * unitPrice * 1;
|
||||
Map<String, Object> segment2 = new HashMap<>();
|
||||
LocalDateTime nextDayTime = operateTime.plusDays(1);
|
||||
segment2.put("startTime",operateTime.toString());
|
||||
segment2.put("endTime", nextDayTime.toString());
|
||||
segment2.put("days", 1);
|
||||
segment2.put("count", currentCount);
|
||||
segment2.put("amount", segmentAmount2);
|
||||
segments.add(segment2);
|
||||
totalItemAmount=totalItemAmount+segmentAmount2;
|
||||
//然后减去
|
||||
currentCount=currentCount-delNum;
|
||||
fasetStarTime=nextDayTime;
|
||||
String fasetStarTimeStr = formatLocalDateTimeToDate(fasetStarTime);
|
||||
if(fasetStarTimeStr.equals(endTimeStr)) {
|
||||
isLast=true;
|
||||
}
|
||||
}else {
|
||||
String fasetStarTimeStr1 = formatLocalDateTimeToDate(fasetStarTime);
|
||||
String operateTimeStr = formatLocalDateTimeToDate(operateTime);
|
||||
if(fasetStarTimeStr1.equals(operateTimeStr)) {
|
||||
operateTime = operateTime.plusDays(1);
|
||||
}
|
||||
//先把领取的
|
||||
long daysBetween=getDay(fasetStarTime,operateTime);
|
||||
if(daysBetween==0) {
|
||||
daysBetween=1;
|
||||
add =false;
|
||||
}
|
||||
|
||||
double segmentAmount = currentCount * unitPrice * daysBetween;
|
||||
Map<String, Object> segment = new HashMap<>();
|
||||
segment.put("startTime",fasetStarTime.toString());
|
||||
segment.put("endTime", operateTime.toString());
|
||||
segment.put("days", daysBetween);
|
||||
totalItemAmount=totalItemAmount+segmentAmount;
|
||||
segment.put("count", currentCount);
|
||||
segment.put("amount", segmentAmount);
|
||||
segments.add(segment);
|
||||
|
||||
currentCount=currentCount+addNum;
|
||||
String fasetStarTimeStr1 = formatLocalDateTimeToDate(fasetStarTime);
|
||||
String operateTimeStr = formatLocalDateTimeToDate(operateTime);
|
||||
if(fasetStarTimeStr1.equals(operateTimeStr)) {
|
||||
operateTime = operateTime.plusDays(1);
|
||||
}
|
||||
//先把领取的
|
||||
long daysBetween=getDay(fasetStarTime,operateTime);
|
||||
if(daysBetween==0) {
|
||||
daysBetween=1;
|
||||
add =false;
|
||||
}
|
||||
|
||||
// 然后将领取的座位最后一天单独计算
|
||||
double segmentAmount2 = currentCount * unitPrice * 1;
|
||||
Map<String, Object> segment2 = new HashMap<>();
|
||||
LocalDateTime nextDayTime = operateTime.plusDays(1);
|
||||
segment2.put("startTime",operateTime.toString());
|
||||
segment2.put("endTime", nextDayTime.toString());
|
||||
segment2.put("days", 1);
|
||||
segment2.put("count", currentCount);
|
||||
segment2.put("amount", segmentAmount2);
|
||||
segments.add(segment2);
|
||||
totalItemAmount=totalItemAmount+segmentAmount2;
|
||||
//然后减去
|
||||
currentCount=currentCount-delNum;
|
||||
fasetStarTime=nextDayTime;
|
||||
String fasetStarTimeStr = formatLocalDateTimeToDate(fasetStarTime);
|
||||
if(fasetStarTimeStr.equals(endTimeStr)) {
|
||||
isLast=true;
|
||||
|
||||
}
|
||||
double segmentAmount = currentCount * unitPrice * daysBetween;
|
||||
Map<String, Object> segment = new HashMap<>();
|
||||
segment.put("startTime",fasetStarTime.toString());
|
||||
segment.put("endTime", operateTime.toString());
|
||||
segment.put("days", daysBetween);
|
||||
totalItemAmount=totalItemAmount+segmentAmount;
|
||||
segment.put("count", currentCount);
|
||||
segment.put("amount", segmentAmount);
|
||||
segments.add(segment);
|
||||
currentCount=currentCount+addNum;
|
||||
|
||||
// 然后将领取的座位最后一天单独计算
|
||||
double segmentAmount2 = currentCount * unitPrice * 1;
|
||||
Map<String, Object> segment2 = new HashMap<>();
|
||||
LocalDateTime nextDayTime = operateTime.plusDays(1);
|
||||
segment2.put("startTime",operateTime.toString());
|
||||
segment2.put("endTime", nextDayTime.toString());
|
||||
segment2.put("days", 1);
|
||||
segment2.put("count", currentCount);
|
||||
segment2.put("amount", segmentAmount2);
|
||||
segments.add(segment2);
|
||||
totalItemAmount=totalItemAmount+segmentAmount2;
|
||||
//然后减去
|
||||
currentCount=currentCount-delNum;
|
||||
fasetStarTime=nextDayTime;
|
||||
String fasetStarTimeStr = formatLocalDateTimeToDate(fasetStarTime);
|
||||
if(fasetStarTimeStr.equals(endTimeStr)) {
|
||||
isLast=true;
|
||||
|
||||
}
|
||||
|
||||
}else {
|
||||
//无之前的数据的 第一次进来的
|
||||
if(fasetStarTime==null) {
|
||||
|
|
|
|||
Loading…
Reference in New Issue