DeXun/klp-oa
9
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

refactor(WarehouseInterlaced): 简化仓库位置ID的过滤逻辑

Browse Source 
移除冗余的统计和过滤步骤，直接使用去重后的splitIds作为locationIds
This commit is contained in:
砂糖
2025-12-20 15:58:14 +08:00
parent 720e2d514f
commit 517157bcb0
1 changed files with 8 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
klp-ui/src/views/wms/warehouse/components/WarehouseInterlaced.vue
View File

@@ -238,15 +238,16 @@ export default {
if (layer2Warehouses[i]) splitIds.push(layer2Warehouses[i].parentId); if (layer2Warehouses[i]) splitIds.push(layer2Warehouses[i].parentId);
} }
// 1. 先统计每个 parentId 出现的次数 // 1. 先统计每个 parentId 出现的次数
const countMap = splitIds.reduce((map, id) => { // const countMap = splitIds.reduce((map, id) => {
map.set(id, (map.get(id) || 0) + 1); // map.set(id, (map.get(id) || 0) + 1);
return map; // return map;
}, new Map()); // }, new Map());
// 2. 过滤出至少出现两次的 parentId，再去重（map的key本身唯一，去重可省略但保留更严谨） // 2. 过滤出至少出现两次的 parentId，再去重（map的key本身唯一，去重可省略但保留更严谨）
payload.locationIds = [...new Set( // payload.locationIds = [...new Set(
splitIds.filter(id => countMap.get(id) >= 2) // splitIds.filter(id => countMap.get(id) >= 2)
)]; // )];
payload.locationIds = [...new Set(splitIds)]
console.log(payload) console.log(payload)
this.handleMergeWarehouse(payload); this.handleMergeWarehouse(payload);
} else if (newLevel === 4) { } else if (newLevel === 4) {