peng
2 天以前 fa27fd4a21e04352a97988c153b7709ebecc4e89
framework/src/main/java/cn/lili/modules/goods/serviceimpl/GoodsServiceImpl.java
@@ -128,6 +128,9 @@
    private Cache<GoodsVO> cache;
    @Autowired
    private GoodsService goodsService;
    @Autowired
    private COSUtil cosUtil;
    @Override
@@ -514,16 +517,253 @@
        boolean result;
        //检测管理员权限
        this.checkManagerAuthority();
        // 获取当前商品的原始排序值
        Goods currentGoods = this.getById(req.getGoodsId());
        Integer oldSort = currentGoods != null ? currentGoods.getGoodsSort() : null;
        Integer newSort = req.getSort();
        // 收集需要更新ES的商品ID
        List<String> goodsIdsToUpdateEs = new ArrayList<>();
        goodsIdsToUpdateEs.add(req.getGoodsId());
        // 处理数据库中的重复排序值,确保唯一性
        List<String> duplicateResolvedGoodsIds = resolveDuplicateSorts();
        goodsIdsToUpdateEs.addAll(duplicateResolvedGoodsIds);
        // 重新获取当前商品的排序值(可能已被resolveDuplicateSorts修改)
        currentGoods = this.getById(req.getGoodsId());
        oldSort = currentGoods != null ? currentGoods.getGoodsSort() : null;
        // 根据操作类型执行不同的排序逻辑
        if (oldSort == null) {
            // 新增排序
            List<String> affectedGoodsIds = adjustForInsert(newSort);
            goodsIdsToUpdateEs.addAll(affectedGoodsIds);
            // 处理可能产生的重复排序值
            List<String> afterInsertResolvedGoodsIds = resolveDuplicateSorts();
            goodsIdsToUpdateEs.addAll(afterInsertResolvedGoodsIds);
        } else if (!oldSort.equals(newSort)) {
            // 修改排序
            if (newSort > oldSort) {
                // 排序值增大:将大于等于新排序值的商品+1,直到遇到断层
                List<String> affectedGoodsIds = adjustForIncrease(newSort);
                goodsIdsToUpdateEs.addAll(affectedGoodsIds);
                // 处理可能产生的重复排序值
                List<String> afterIncreaseResolvedGoodsIds = resolveDuplicateSorts();
                goodsIdsToUpdateEs.addAll(afterIncreaseResolvedGoodsIds);
            } else {
                // 排序值减小:将大于等于新排序值且小于原排序值的商品+1,直到遇到断层
                List<String> affectedGoodsIds = adjustForDecrease(oldSort, newSort);
                goodsIdsToUpdateEs.addAll(affectedGoodsIds);
                // 处理可能产生的重复排序值
                List<String> afterDecreaseResolvedGoodsIds = resolveDuplicateSorts();
                goodsIdsToUpdateEs.addAll(afterDecreaseResolvedGoodsIds);
            }
        }
        // 更新当前商品的排序值
        LambdaUpdateWrapper<Goods> updateWrapper = new LambdaUpdateWrapper<>();
        updateWrapper.set(Goods::getGoodsSort,req.getSort());
        updateWrapper.set(Goods::getGoodsSort, newSort);
        updateWrapper.eq(Goods::getId, req.getGoodsId());
        result = this.update(updateWrapper);
        List<String> goodsIds = new ArrayList<>();
        goodsIds.add(req.getGoodsId());
        this.updateEsGoods(goodsIds);
        // 更新ES索引
        this.updateEsGoods(goodsIdsToUpdateEs);
        return result;
    }
    /**
     * 处理数据库中的重复排序值,确保唯一性
     * @return 受影响的商品ID列表
     */
    @Transactional(rollbackFor = Exception.class)
    public List<String> resolveDuplicateSorts() {
        // 查询所有有排序值的商品
        LambdaQueryWrapper<Goods> queryWrapper = new LambdaQueryWrapper<>();
        queryWrapper.isNotNull(Goods::getGoodsSort);
        queryWrapper.orderByAsc(Goods::getGoodsSort);
        List<Goods> allGoods = this.list(queryWrapper);
        // 按排序值分组
        Map<Integer, List<Goods>> sortMap = allGoods.stream()
                .collect(Collectors.groupingBy(Goods::getGoodsSort));
        // 处理重复的排序值,只保留第一个,其余重新分配
        List<Goods> toUpdate = new ArrayList<>();
        int nextSort = getMaxSortValue(allGoods) + 1; // 从当前最大值+1开始分配
        for (Map.Entry<Integer, List<Goods>> entry : sortMap.entrySet()) {
            List<Goods> goodsList = entry.getValue();
            if (goodsList.size() > 1) {
                // 有重复值,只保留第一个,其余重新分配
                for (int i = 1; i < goodsList.size(); i++) {
                    Goods goods = goodsList.get(i);
                    goods.setGoodsSort(nextSort++);
                    toUpdate.add(goods);
                }
            }
        }
        // 收集受影响的商品ID
        List<String> affectedGoodsIds = toUpdate.stream()
                .map(Goods::getId)
                .collect(Collectors.toList());
        // 批量更新
        if (!toUpdate.isEmpty()) {
            this.updateBatchById(toUpdate);
        }
        return affectedGoodsIds;
    }
    /**
     * 获取当前最大的排序值
     * @param goodsList 商品列表
     * @return 最大排序值
     */
    private int getMaxSortValue(List<Goods> goodsList) {
        return goodsList.stream()
                .mapToInt(Goods::getGoodsSort)
                .max()
                .orElse(0);
    }
    /**
     * 插入新排序值的处理逻辑
     * 将所有大于等于新排序值的商品排序值+1,直到遇到断层
     * @param newSort 新的排序值
     * @return 受影响的商品ID列表
     */
    @Transactional(rollbackFor = Exception.class)
    public List<String> adjustForInsert(Integer newSort) {
        if (newSort == null) return Collections.emptyList();
        // 查询所有大于等于新排序值的商品,按排序值升序排列
        LambdaQueryWrapper<Goods> query = Wrappers.<Goods>lambdaQuery();
        query.ge(Goods::getGoodsSort, newSort);
        query.isNotNull(Goods::getGoodsSort);
        query.orderByAsc(Goods::getGoodsSort);
        List<Goods> goodsList = this.list(query);
        // 检查连续性,遇到断层则停止
        List<Goods> toUpdate = new ArrayList<>();
        int expectedSort = newSort;
        for (Goods goods : goodsList) {
            if (goods.getGoodsSort().equals(expectedSort)) {
                goods.setGoodsSort(goods.getGoodsSort() + 1);
                toUpdate.add(goods);
                expectedSort++;
            } else {
                // 遇到断层,停止调整
                break;
            }
        }
        // 收集受影响的商品ID
        List<String> affectedGoodsIds = toUpdate.stream()
                .map(Goods::getId)
                .collect(Collectors.toList());
        // 批量更新
        if (!toUpdate.isEmpty()) {
            this.updateBatchById(toUpdate);
        }
        return affectedGoodsIds;
    }
    /**
     * 排序值增大的处理逻辑
     * 将所有大于等于新排序值的商品排序值+1,直到遇到断层
     * @param newSort 新排序值
     * @return 受影响的商品ID列表
     */
    @Transactional(rollbackFor = Exception.class)
    public List<String> adjustForIncrease(Integer newSort) {
        if (newSort == null) return Collections.emptyList();
        // 查询所有大于等于新排序值的商品,按排序值升序排列
        LambdaQueryWrapper<Goods> query = Wrappers.<Goods>lambdaQuery();
        query.ge(Goods::getGoodsSort, newSort);
        query.isNotNull(Goods::getGoodsSort);
        query.orderByAsc(Goods::getGoodsSort);
        List<Goods> goodsList = this.list(query);
        // 检查连续性,遇到断层则停止
        List<Goods> toUpdate = new ArrayList<>();
        int expectedSort = newSort;
        for (Goods goods : goodsList) {
            if (goods.getGoodsSort().equals(expectedSort)) {
                goods.setGoodsSort(goods.getGoodsSort() + 1);
                toUpdate.add(goods);
                expectedSort++;
            } else {
                // 遇到断层,停止调整
                break;
            }
        }
        // 收集受影响的商品ID
        List<String> affectedGoodsIds = toUpdate.stream()
                .map(Goods::getId)
                .collect(Collectors.toList());
        // 批量更新
        if (!toUpdate.isEmpty()) {
            this.updateBatchById(toUpdate);
        }
        return affectedGoodsIds;
    }
    /**
     * 排序值减小的处理逻辑
     * 将大于等于新排序值且小于原排序值的商品排序值+1,直到遇到断层
     * @param oldSort 原排序值
     * @param newSort 新排序值
     * @return 受影响的商品ID列表
     */
    @Transactional(rollbackFor = Exception.class)
    public List<String> adjustForDecrease(Integer oldSort, Integer newSort) {
        if (oldSort == null || newSort == null || oldSort.equals(newSort)) return Collections.emptyList();
        // 查询大于等于新排序值且小于原排序值的商品,按排序值升序排列
        LambdaQueryWrapper<Goods> query = Wrappers.<Goods>lambdaQuery();
        query.ge(Goods::getGoodsSort, newSort);
        query.lt(Goods::getGoodsSort, oldSort);
        query.isNotNull(Goods::getGoodsSort);
        query.orderByAsc(Goods::getGoodsSort);
        List<Goods> goodsList = this.list(query);
        // 检查连续性,遇到断层则停止
        List<Goods> toUpdate = new ArrayList<>();
        int expectedSort = newSort;
        for (Goods goods : goodsList) {
            if (goods.getGoodsSort().equals(expectedSort)) {
                goods.setGoodsSort(goods.getGoodsSort() + 1);
                toUpdate.add(goods);
                expectedSort++;
            } else {
                // 遇到断层,停止调整
                break;
            }
        }
        // 收集受影响的商品ID
        List<String> affectedGoodsIds = toUpdate.stream()
                .map(Goods::getId)
                .collect(Collectors.toList());
        // 批量更新
        if (!toUpdate.isEmpty()) {
            this.updateBatchById(toUpdate);
        }
        return affectedGoodsIds;
    }
    @Override
    @Transactional(rollbackFor = Exception.class)
    @SystemLogPoint(description = "删除商品", customerLog = "'操作对象:['+#goodsIds+']'")