当问到List几个一边遍历一边删除时我想第一时间就会写出以下的代码
/**
* @Author:cbx
* @Date:2020/10/16/13:12
*/
public class TestList {
public static void main(String[] args) {
List<String> resList=new ArrayList<>();
resList.add("james");
resList.add("kd");
resList.add("kobe");
for (String value:resList){
if (value.equals("kd")){
resList.remove(value);
}
}
System.out.println(resList);
}
}
结果却是爆了一个java.util.ConcurrentModificationException(并发修改异常)
查看一下刚才代码的字节码
public class TestList {
public TestList() {
}
public static void main(String[] args) {
List<String> resList = new ArrayList();
resList.add("james");
resList.add("kd");
resList.add("kobe");
Iterator var2 = resList.iterator();
while(var2.hasNext()) {
String value = (String)var2.next();
if (value.equals("kd")) {
resList.remove(value);
}
}
System.out.println(resList);
}
}
forEach循环在实际执行时,其实使用的是Iterator,使用的核心方法是hasNext()和next()。
看一下ArrayList类的Iterator是如何实现的?
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;
Itr() {}
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();
}
}
@Override
@SuppressWarnings("unchecked")
public void forEachRemaining(Consumer<? super E> consumer) {
Objects.requireNonNull(consumer);
final int size = ArrayList.this.size;
int i = cursor;
if (i >= size) {
return;
}
final Object[] elementData = ArrayList.this.elementData;
if (i >= elementData.length) {
throw new ConcurrentModificationException();
}
while (i != size && modCount == expectedModCount) {
consumer.accept((E) elementData[i++]);
}
// update once at end of iteration to reduce heap write traffic
cursor = i;
lastRet = i - 1;
checkForComodification();
}
final void checkForComodification() {
if (modCount != expectedModCount)
//这里就是具体报错的地方,抛出了一个并发修改异常
throw new ConcurrentModificationException();
}
}
这里需要比较modCount和expectedModCount的值
刚开始modCount和expectedModCount都是3
执行了remove方法后
所以下一次再进行调用next()方法的时候,校验时就会出现modCount!=expectedModCount 而抛出异常。
解决方法
- 使用Iterator的remove()方法
- 使用for循环正序遍历
- 使用for循环倒序遍历
使用iterator的remove方法
使用for循环正序遍历
for(int i=0;i<resList.size();i++){
String item=resList.get(i);
if (item.equals("kd")){
resList.remove(i);
//注意,必须这里要索引-1,因为数组该位置被删除后,后面的替上来
i=i-1;
}
}
使用for循环逆序遍历
for(int i=resList.size();i>=0;i--){
String item=resList.get(i);
if (item.equals("kd")){
resList.remove(i);
}
}