修改提示

This commit is contained in:
2026-03-04 14:45:47 +08:00
parent a204336b58
commit b66c025cf8
3 changed files with 19 additions and 36 deletions
@@ -1642,6 +1642,7 @@ public class ProductService {
if (craft_list.contains("双面烫镭射银")) {
rate = rate * 1.8;
}
dto2 = new Product();
dto2.setCount(count_list[i]);
dto2.setPrice(Math.ceil(prices[i] * rate));
@@ -1665,7 +1666,12 @@ public class ProductService {
int min = getNum(length, width);
for (Product product : priceList) {
product.setPrice(Math.floor(product.getPrice() * number * min));
double mqPrice = 0;
if (craft_list.contains("异形模切") && !(craft_list.contains("击凸") || craft_list.contains("压凹") || (craft_list.contains("单面烫金") || craft_list.contains("双面烫金") || craft_list.contains("烫镭射银")))) {
mqPrice = Math.ceil(15 * 0.01 * product.getCount() + 50);
}
product.setPrice(Math.floor(product.getPrice() * number * min + mqPrice));
product.setWeight(df.format(number * (length) / 100 * (width) / 100 * product.getCount() * 0.5));
}
return priceList;
@@ -1726,7 +1732,8 @@ public class ProductService {
if (i < count) {
continue;
}
int num = (int) Math.ceil(i * number / max);
// int num = (int) Math.ceil(i * number / max);
int num = (int) Math.ceil(i / max);
// 婚礼卡
price = fixPrice + (num - 1) * zhang + designFee + cutFee;
@@ -1751,36 +1758,8 @@ public class ProductService {
}
//第二款开始的设计费按照式设计内容
if (number > 1) {
double desFee = 0;
if (!role.contains("1045") && !role.contains("1054") && !role.contains("1029")) {
if (dto.getP() == 1) {
desFee = 0.6 * (number - 1);
} else {
desFee = 5.5 * (number - 1);
}
for (Product product : priceList) {
product.setPrice(Math.ceil(product.getPrice() + desFee));
}
} else {
if (dto.getP() == 1) {
desFee = 0.6;
} else if (dto.getP() == 2 || dto.getP() == 3) {
desFee = 0.8;
} else if (dto.getP() == 4) {
desFee = 1.2;
} else if (dto.getP() == 5) {
desFee = 2;
} else {
desFee = 5;
}
for (Product product : priceList) {
product.setPrice(Math.floor(product.getPrice() + desFee * (number - 1)));
}
}
for (Product product : priceList) {
product.setPrice(Math.ceil(product.getPrice() * number));
}
return priceList;
} else {
@@ -7162,7 +7141,7 @@ public class ProductService {
double price = 0;
for (int i = 0; i < bigCountArr.length; i++) {
if (product.getCount() >= bigCountArr[i]) {
price = productPrice + basePrice[i];
price = productPrice + basePrice[i] * number;
}
}
product.setPrice(Math.max(price, productPrice));