List踩坑

最新推荐文章于 2024-07-19 15:37:00 发布

索大大的狂想

最新推荐文章于 2024-07-19 15:37:00 发布

阅读量86

点赞数 2

文章标签： list 数据结构

本文链接：https://blog.csdn.net/weixin_42181250/article/details/135960756

版权

Iterator<VisualizationStorage> iterator = visualizationList.iterator();
        while (iterator.hasNext()) {
            VisualizationStorage visualizationStorage = iterator.next();
            if (null != visualizationStorage.getInventoryCountId()) {
                InventoryCount inventoryCount = inventoryCountService.getById(visualizationStorage.getInventoryCountId());
                if (inventoryCount.getCountSubmitStatus().equals(InventoryEnum.SAVESTATE.getValue())) {
                    iterator.remove();
                }
            }
        }

这种 iterator remove方法如果只剩下一个元素的时候会报错

        List<VisualizationStorage> visualizationList = enterWareRelService.getVisualizationStorage(userInfoDto.getDepartmentId());
        List<VisualizationStorage> elementsToRemove = new ArrayList<>();
        for (VisualizationStorage visualizationStorage : visualizationList) {
            if (null != visualizationStorage.getInventoryCountId()) {
                InventoryCount inventoryCount = inventoryCountService.getById(visualizationStorage.getInventoryCountId());
                if (inventoryCount.getCountSubmitStatus().equals(InventoryEnum.SAVESTATE.getValue())) {
                    elementsToRemove.add(visualizationStorage);
                }
            }
        }
        visualizationList.removeAll(elementsToRemove);