修改白胶价格
Цей коміт міститься в:
@@ -1044,20 +1044,6 @@ public class ProductService {
|
|||||||
product.setPrice(product.getPrice() - 10);
|
product.setPrice(product.getPrice() - 10);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
for (int i = 0; i < dto.getCraft().length; i++) {
|
|
||||||
if ("模切".equals(dto.getCraft()[i])) {
|
|
||||||
dto.getCraft()[i] = "";
|
|
||||||
}
|
|
||||||
if ("双面覆哑膜".equals(dto.getCraft()[i])) {
|
|
||||||
dto.getCraft()[i] = "";
|
|
||||||
}
|
|
||||||
if ("压痕".equals(dto.getCraft()[i])) {
|
|
||||||
dto.getCraft()[i] = "";
|
|
||||||
}
|
|
||||||
if ("压点线".equals(dto.getCraft()[i])) {
|
|
||||||
dto.getCraft()[i] = "";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
if ("1".equals(dto.getKind())) {
|
if ("1".equals(dto.getKind())) {
|
||||||
dto.setLengthTang(length);
|
dto.setLengthTang(length);
|
||||||
@@ -6852,7 +6838,7 @@ public class ProductService {
|
|||||||
}
|
}
|
||||||
|
|
||||||
private List<Product> getCheTiePrice(Product dto, double length, double width) {
|
private List<Product> getCheTiePrice(Product dto, double length, double width) {
|
||||||
double minPrice = 35;
|
double minPrice = 50;
|
||||||
length = length / 100;
|
length = length / 100;
|
||||||
width = width / 100;
|
width = width / 100;
|
||||||
double area = length * width;
|
double area = length * width;
|
||||||
@@ -6872,7 +6858,6 @@ public class ProductService {
|
|||||||
}
|
}
|
||||||
//反光贴
|
//反光贴
|
||||||
if ("2".equals(dto.getKind())) {
|
if ("2".equals(dto.getKind())) {
|
||||||
minPrice = 30;
|
|
||||||
if (area <= 1) {
|
if (area <= 1) {
|
||||||
basePrice = 138;
|
basePrice = 138;
|
||||||
} else if (area <= 2) {
|
} else if (area <= 2) {
|
||||||
|
|||||||
@@ -431,7 +431,14 @@ public class PosterPrice {
|
|||||||
}
|
}
|
||||||
price = Math.max(area * danjia, min_price) * number;
|
price = Math.max(area * danjia, min_price) * number;
|
||||||
if (area < areas[0]) {
|
if (area < areas[0]) {
|
||||||
price = min_price + 10 * number;
|
area = area * number;
|
||||||
|
for (int i = 0; i < areas.length; i++) {
|
||||||
|
if (area <= areas[i]) {
|
||||||
|
danjia = prices[i];
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
price = Math.max(min_price, area * danjia) + 25 + 15 * (number - 1);
|
||||||
}
|
}
|
||||||
pro.setPrice(Math.ceil(price));
|
pro.setPrice(Math.ceil(price));
|
||||||
} else {
|
} else {
|
||||||
|
|||||||
Посилання в новій задачі
Заблокувати користувача