java中集合删除元素操作实践与解析

public class ArraylistRemoveTest {

     public static void main(String[] args) {
       List<String> list =  new ArrayList<String>();
       list.add("a");
       list.add("b");
       list.add("c");
       list.add("d");
       remove(list,"b");
    }

    public static void print( List<String> list){
        for (String item:list) {
            System.out.println("list:item"+item);
        }
    }

    public static void remove(List<String> list,String target){
             for (String item:list) {
                 if(item.equals(target)){
                     list.remove(item);
                 }
             }
             print(list);
    }
}

执行 方法,出现如下错误:

Exception in thread "main" java.util.ConcurrentModificationException
	at java.util.ArrayList$Itr.checkForComodification(ArrayList.java:859)
	at java.util.ArrayList$Itr.next(ArrayList.java:831)
	at com.ips.list.ArrayListRemove.remove21(ArrayListRemove.java:82)
	at com.ips.list.ArrayListRemove.main(ArrayListRemove.java:17)

产生java.util.ConcurrentModificationException异常。foreach 写法实际上是对的 Iterable、hasNext、next方法的简写。因此我们从List.iterator()着手分析,跟踪iterator()方法,该方法返回了 Itr 迭代器对象。

public Iterator<E> iterator() {
	return new Itr();
}

Itr 类定义代码:

private class Itr implements Iterator<E> {
    int cursor;       // index of next element to return
    int lastRet = -1; // index of last element returned; -1 if no such
    int expectedModCount = modCount;

    public boolean hasNext() {
        return cursor != size;
    }

    @SuppressWarnings("unchecked")
    public E next() {
        checkForComodification();
        int i = cursor;
        if (i >= size)
            throw new NoSuchElementException();
        Object[] elementData = ArrayList.this.elementData;
        if (i >= elementData.length)
            throw new ConcurrentModificationException();
        cursor = i + 1;
        return (E) elementData[lastRet = i];
    }

    public void remove() {
        if (lastRet < 0)
            throw new IllegalStateException();
        checkForComodification();

        try {
            ArrayList.this.remove(lastRet);
            cursor = lastRet;
            lastRet = -1;
            expectedModCount = modCount;
        } catch (IndexOutOfBoundsException ex) {
            throw new ConcurrentModificationException();
        }
    }

    final void checkForComodification() {
        if (modCount != expectedModCount)
            throw new ConcurrentModificationException();
    }
}

通过代码我们发现 Itr 是 ArrayList 中定义的一个私有内部类,在 next、remove方法中都会调用 checkForComodification 方法,该方法的作用是判断 modCount != expectedModCount是否相等,如果不相等则抛出ConcurrentModificationException异常。每次正常执行 remove 方法后,都会对执行expectedModCount = modCount赋值,保证两个值相等,那么问题基本上已经清晰了,在 foreach 循环中执行 list.remove(item);,对 list 对象的 modCount 值进行了修改,而 list 对象的迭代器的 expectedModCount 值未进行修改,因此抛出了ConcurrentModificationException异常。

二:先获取list的size,删除后导致size变化,索引越界 失败
 public static void remove2(List<String> list,String target){
        int size = list.size();
        for(int i= 0;i<size;i++){
             if(list.get(i).equals(target)){
                 list.remove(target);
             }
         }
         print(list);
    }
    Exception in thread “main” java.lang.IndexOutOfBoundsException: Index: 5, Size: 5
at java.util.ArrayList.rangeCheck(ArrayList.java:635)
at java.util.ArrayList.get(ArrayList.java:411)
at com.ips.list.ArrayListRemove.remove11(ArrayListRemove.java:33)
at com.ips.list.ArrayListRemove.main(ArrayListRemove.java:17)

由于int size = list.size();提前获取了 List 的大小,for 循环中删除了两个元素,导致出现数组越界问题。

三:使用迭代器的iterator.remove()删除成功
 public static void remove4(List<String> list,String target){
        Iterator<String> iterator = list.iterator();
        while(iterator.hasNext()){
            String next = iterator.next();
            if(target.equals(next)){
                iterator.remove();
            }
        }
        print(list);
    }
四 modCount与iterator的数量不同 失败
 public static void remove4(List<String> list,String target){
        Iterator<String> iterator = list.iterator();
        while(iterator.hasNext()){
            String next = iterator.next();
            if(target.equals(next)){
                list.remove(next);
            }
        }
        print(list);
    }
    
    Exception in thread "main" java.util.ConcurrentModificationException
	at java.util.ArrayList$Itr.checkForComodification(ArrayList.java:909)
	at java.util.ArrayList$Itr.next(ArrayList.java:859)
	at com.cainiao.product.dwork.built.starter.metaq.ArraylistRemoveTest.remove4(ArraylistRemoveTest.java:66)
	at com.cainiao.product.dwork.built.starter.metaq.ArraylistRemoveTest.main(ArraylistRemoveTest.java:17)
Disconnected from the target VM, address: '127.0.0.1:59414', transport: 'socket'
Process finished with exit code 1

五:CopyOnWriteArrayList 成功
 public static void remove5(List<String> list,String target){
        final CopyOnWriteArrayList<String> copyList = new CopyOnWriteArrayList<>(list);
        for (String item:copyList) {
            if(item.equals(target)){
                copyList.remove(item);
            }
        }
        print(copyList);
    }
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值