aidlab/sora_back
7
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

TASK:mitu报表

Browse Source
This commit is contained in:
shahaibo
2024-04-03 11:36:52 +08:00
parent 5be51d3818
commit 60c7717f31
2 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/main/java/com/mixi/common/tasks/MiTuExportScheduledTask.java
View File

@@ -53,10 +53,10 @@ public class MiTuExportScheduledTask {
@PostConstruct @PostConstruct
public void executeWeeklyHeavyStockReport() { public void executeWeeklyHeavyStockReport() {
// customerPurchaseReport(); // customerPurchaseReport();
NewJoinVIPReport(); // NewJoinVIPReport();
weeklySellThrReport(); // weeklySellThrReport();
WeeklyHeavyStockReport(); // WeeklyHeavyStockReport();
QuarterlyProductGroupingReport(); // QuarterlyProductGroupingReport();
} }
/** /**

4
src/main/java/com/mixi/service/PythonService.java
View File

@@ -169,10 +169,10 @@ public class PythonService {
MediaType mediaType = MediaType.parse("application/json"); MediaType mediaType = MediaType.parse("application/json");
Map<String, Object> content = Maps.newHashMap(); Map<String, Object> content = Maps.newHashMap();
//范围，范围越大，速度越慢。现在调试阶段可以设为10，也就是从10套中选最好的5套。 //范围，范围越大，速度越慢。现在调试阶段可以设为10，也就是从10套中选最好的5套。
content.put("max_outfits", 5); content.put("max_outfits", 10);
content.put("is_best", Boolean.TRUE); content.put("is_best", Boolean.TRUE);
//输出得分最高的时装的套数（topk < range //输出得分最高的时装的套数（topk < range
content.put("topk", 1); content.put("topk", 5);
//需要搭配的衣服,数组 //需要搭配的衣服,数组
//去重 //去重
// List<GenerateCollocationQueryDTO> queryAfter = CollectionUtil.emptyIfNull(query).stream().collect(Collectors.collectingAndThen( // List<GenerateCollocationQueryDTO> queryAfter = CollectionUtil.emptyIfNull(query).stream().collect(Collectors.collectingAndThen(