以 Iterator.remove()为例子
直接看代码
public static void main(String[] args) {
List<String> alist = Arrays.asList(new String());
Iterator<String> iterator = alist.iterator();
while (iterator.hasNext()) {
String str = iterator.next();
//过滤list元素逻辑
if (true) {
iterator.remove();
}
}
}
错误为:
Exception in thread "main" java.lang.UnsupportedOperationException
at java.util.AbstractList.remove(AbstractList.java:161)
at java.util.AbstractList$Itr.remove(AbstractList.java:374)
改为正确方式
public static void main(String[] args) {
List<String> alist = new ArrayList<>();
alist.add("test");
Iterator<String> iterator = alist.iterator();
while (iterator.hasNext()) {
String str = iterator.next();
//过滤list元素逻辑
if (true) {
iterator.remove();
}
}
}
两种方式区别
List<String> alist = Arrays.asList(new String());
List<String> alist = new ArrayList<>();
alist.add("test");
导致报错原因:
首先分析两者之间获取的 Iterator 接口实例是否相同。(Iterator 本身是接口 默认remove方法为default void remove() { throw new UnsupportedOperationException("remove");} 如果抛异常也是实例覆盖remove方法抛出异常)
Iterator<String> iterator = alist.iterator();
很显然不同,一个是ArrayList 一个是 AbstractList

Arrays.asList();方式
可以看到Arrays 使用自己内部 静态 ArrayList 并不是 java.util.ArrayList

看一下静态ArrayList继承 AbstractList内容 并无复写 iterator方法 所以调用 alist.iterator();是AbstractList 中iterator方法。
第一张截图也得到了论证
private static class ArrayList<E> extends AbstractList<E>
implements RandomAccess, java.io.Serializable
{
private static final long serialVersionUID = -2764017481108945198L;
private final E[] a;
ArrayList(E[] array) {
a = Objects.requireNonNull(array);
}
@Override
public int size() {
return a.length;
}
@Override
public Object[] toArray() {
return a.clone();
}
@Override
@SuppressWarnings("unchecked")
public <T> T[] toArray(T[] a) {
int size = size();
if (a.length < size)
return Arrays.copyOf(this.a, size,
(Class<? extends T[]>) a.getClass());
System.arraycopy(this.a, 0, a, 0, size);
if (a.length > size)
a[size] = null;
return a;
}
@Override
public E get(int index) {
return a[index];
}
@Override
public E set(int index, E element) {
E oldValue = a[index];
a[index] = element;
return oldValue;
}
@Override
public int indexOf(Object o) {
E[] a = this.a;
if (o == null) {
for (int i = 0; i < a.length; i++)
if (a[i] == null)
return i;
} else {
for (int i = 0; i < a.length; i++)
if (o.equals(a[i]))
return i;
}
return -1;
}
@Override
public boolean contains(Object o) {
return indexOf(o) != -1;
}
@Override
public Spliterator<E> spliterator() {
return Spliterators.spliterator(a, Spliterator.ORDERED);
}
@Override
public void forEach(Consumer<? super E> action) {
Objects.requireNonNull(action);
for (E e : a) {
action.accept(e);
}
}
@Override
public void replaceAll(UnaryOperator<E> operator) {
Objects.requireNonNull(operator);
E[] a = this.a;
for (int i = 0; i < a.length; i++) {
a[i] = operator.apply(a[i]);
}
}
@Override
public void sort(Comparator<? super E> c) {
Arrays.sort(a, c);
}
}
具体iterator接口实例内容
private class Itr implements Iterator<E> {
/**
* Index of element to be returned by subsequent call to next.
*/
int cursor = 0;
/**
* Index of element returned by most recent call to next or
* previous. Reset to -1 if this element is deleted by a call
* to remove.
*/
int lastRet = -1;
/**
* The modCount value that the iterator believes that the backing
* List should have. If this expectation is violated, the iterator
* has detected concurrent modification.
*/
int expectedModCount = modCount;
public boolean hasNext() {
return cursor != size();
}
public E next() {
checkForComodification();
try {
int i = cursor;
E next = get(i);
lastRet = i;
cursor = i + 1;
return next;
} catch (IndexOutOfBoundsException e) {
checkForComodification();
throw new NoSuchElementException();
}
}
public void remove() {
if (lastRet < 0)
throw new IllegalStateException();
checkForComodification();
try {
AbstractList.this.remove(lastRet);
if (lastRet < cursor)
cursor--;
lastRet = -1;
expectedModCount = modCount;
} catch (IndexOutOfBoundsException e) {
throw new ConcurrentModificationException();
}
}
final void checkForComodification() {
if (modCount != expectedModCount)
throw new ConcurrentModificationException();
}
}
这是重点后边我们比较一下remove方法有何不同

new ArrayList<>();方式
可以看到 ArrayList类 中使用匿名内部类实现了Iterator接口实例 并通过 iterator获取。

具体实现Iterator接口内容

最后比较一下remove方法不同,报错显示是remove
Exception in thread "main" java.lang.UnsupportedOperationException
at java.util.AbstractList.remove(AbstractList.java:161)
at java.util.AbstractList$Itr.remove(AbstractList.java:374)
首先看Arrays.asList()方式获取iterator 中remove方法。正好看错误提示 AbstractList:374行

具体内容 AbstractList:161会直接抛出异常,看到这里我们就知道异常怎么来的啦

new ArrayList<>();方式

具体remove 方法:

总结一句话 ArrayList 重写了 AbstractList 抽象类的remove方法和add 方法支持操作实例,而Arrays创建的List实例没有重写 AbstractList中的remove方法和add方法。
AbstractList 默认remove和add方法抛出UnsupportedOperationException异常


建议:如果想要过滤List中元素,正好你使用的JDK8 可以考虑list.stream().filter() 进行过滤。这样就不用区分那种方式获取的List 实例了。(这种方式重新创建了一个List对象,会消耗一点堆空间)
例子:
public static void main(String[] args) {
List<String> alist = new ArrayList<>();
alist.add("test");
alist.add("test1");
List<String> alist1 = Arrays.asList("test1", "test2");
System.out.println(alist);
System.out.println(alist1);
alist =alist.stream().filter(str->!str.equals("test1")).collect(Collectors.toList());
alist1= alist1.stream().filter(str->!str.equals("test1")).collect(Collectors.toList());
System.out.println(alist);
System.out.println(alist1);
}
结果:
[test, test1]
[test1, test2]
[test]
[test2]
本文通过一个错误案例分析了在Java中使用Arrays.asList()创建的List实例与ArrayList直接创建的实例在调用iterator().remove()时为何会抛出UnsupportedOperationException。主要原因是Arrays.asList()返回的内部类并没有重写AbstractList的remove方法,而ArrayList则进行了重写。建议使用Java 8的list.stream().filter()进行过滤操作,以避免此类问题。

401

被折叠的 条评论
为什么被折叠?



