记一次开发中未注意到的小细节,在对List进行remove操作时出现报错:java.lang.UnsupportedOperationException
- 测试代码:
public static void main(String[] args) {
List<String> list = Arrays.asList("1,2,3,4,5,6,7".split(","));
System.out.println("list------>"+list);
list.remove("1");
}
- 报错信息:
list------>[1, 2, 3, 4, 5, 6, 7]
Exception in thread "main" java.lang.UnsupportedOperationException
at java.util.AbstractList.remove(AbstractList.java:161)
at java.util.AbstractList$Itr.remove(AbstractList.java:374)
at java.util.AbstractCollection.remove(AbstractCollection.java:293)
at org.pty.pex.rest.TestYms.main(TestYms.java:194)
Process finished with exit code 1
- 原因分析:
该List是通过Arrays.asList()得到的,在调用其remove()方法的时候报出该异常,通过分析源码发现Arrays.asList()返回的是java.util.Arrays的内部类ArrayList<>(),并不是java.util.ArrayList。Arrays的内部类ArrayList<>()和java.util.ArrayList都继承了抽象类AbstractList<E>,add()、remove()等方法是AbstractList中的方法,在AbstractList中这些方法只有throw new UnsupportedOperationException(),并没有进行其他操作。而java.util.ArrayList对这些方法进行了重写,添加了一些自己的操作,而Arrays的内部类ArrayList<>()并没有对这些方法进行重写,导致在调用的时候直接抛出异常java.lang.UnsupportedOperationException。
- 源码解析
AbstractList
//截取自AbstractList
public boolean add(E e) {
add(size(), e);
return true;
}
//没有进行其他任何操作
public void add(int index, E element) {
throw new UnsupportedOperationException();
}
java.util.ArrayList
//对add方法进行了重写
public boolean add(E e) {
ensureCapacityInternal(size + 1); // Increments modCount!!
elementData[size++] = e;
return true;
}
Arrays.asList()
//Arrays.asList()方法,返回值为其内部类ArrayList
public static <T> List<T> asList(T... a) {
return new ArrayList<>(a);
}
/**
* @serial include
*该类继承了AbstractList<E>,但是并未对add()、remove()等方法进行重写
*/
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);
}
}