1.是什么
ArrayList
是一个非线程安全的集合,实现了RandomAccess
接口。
JDK中写到实现了RandomAccess接口的List,用普通的for循环比增强for循环效率更高,如下面代码所示,上面的循环运行速度更快
for (int i=0, n=list.size(); i < n; i++)
list.get(i);
// runs faster than this loop:
for (Iterator i=list.iterator(); i.hasNext(); )
i.next();
2.构造方法
如果在创建ArrayList对象的时候使用public ArrayList(int initialCapacity)
构造函数传入初始容量,这样就可以在添加元素时减少复制数组的操作,提高性能。
如果创建ArrayList对象的时候传入的初始容量为0,这初始化元素数组为空数组(EMPTY_ELEMENTDATA )。
如果创建ArrayList对象使用的默认构造函数,则初始化元素数组为空数组(DEFAULTCAPACITY_EMPTY_ELEMENTDATA )
private static final int DEFAULT_CAPACITY = 10;
private static final Object[] EMPTY_ELEMENTDATA = {};
private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
transient Object[] elementData; // non-private to simplify nested class access
// 集合中的元素个数
private int size;
public ArrayList(int initialCapacity) {
if (initialCapacity > 0) {
this.elementData = new Object[initialCapacity];
} else if (initialCapacity == 0) {
this.elementData = EMPTY_ELEMENTDATA;
} else {
throw new IllegalArgumentException("Illegal Capacity: "+
initialCapacity);
}
}
public ArrayList() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
public ArrayList(Collection<? extends E> c) {
elementData = c.toArray();
if ((size = elementData.length) != 0) {
// c.toArray might (incorrectly) not return Object[] (see 6260652)
if (elementData.getClass() != Object[].class)
elementData = Arrays.copyOf(elementData, size, Object[].class);
} else {
// replace with empty array.
this.elementData = EMPTY_ELEMENTDATA;
}
}
3.新增方法
Arrays.copy的底层使用的方法: public static native void arraycopy(Object src, int srcPos, Object dest, int destPos, int length);
public boolean add(E e) {
ensureCapacityInternal(size + 1); // Increments modCount!!
elementData[size++] = e;
return true;
}
private void ensureCapacityInternal(int minCapacity) {
// 1.首先判断元素数组是否为默认的空数组,如果是的话则设置minCapacity为DEFAULT_CAPACITY(值为10)和minCapacity(元素个数+1)较大的一个
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
}
ensureExplicitCapacity(minCapacity);
}
private void ensureExplicitCapacity(int minCapacity) {
// 2.modCount(该元素用来记录list在结构上被修改的次数)自增1
modCount++;
// overflow-conscious code
// 3.如果minCapacity比元素数组的长度大,则增长元素数组的长度
if (minCapacity - elementData.length > 0)
grow(minCapacity);
}
private void grow(int minCapacity) {
// overflow-conscious code
int oldCapacity = elementData.length;
// 4.设置newCapacity的值为元素数组长度的1.5倍
int newCapacity = oldCapacity + (oldCapacity >> 1);
if (newCapacity - minCapacity < 0)
newCapacity = minCapacity;
if (newCapacity - MAX_ARRAY_SIZE > 0)
newCapacity = hugeCapacity(minCapacity);
// minCapacity is usually close to size, so this is a win:
elementData = Arrays.copyOf(elementData, newCapacity);
}
private static int hugeCapacity(int minCapacity) {
if (minCapacity < 0) // overflow
throw new OutOfMemoryError();
return (minCapacity > MAX_ARRAY_SIZE) ?
Integer.MAX_VALUE :
MAX_ARRAY_SIZE;
}
4.获取方法
public E get(int index) {
// 1.检验index是否在已有元素范围内
rangeCheck(index);
// 2.返回索引位置的元素
return elementData(index);
}
private void rangeCheck(int index) {
if (index >= size)
throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
}
E elementData(int index) {
return (E) elementData[index];
}
5.移除方法
public E remove(int index) {
// 1.检验索引位置是否合法
rangeCheck(index);
// 2.修改次数记录自增1
modCount++;
E oldValue = elementData(index);
int numMoved = size - index - 1;
if (numMoved > 0)
// 3.使用本地方法的数组复制方法来移动元素
System.arraycopy(elementData, index+1, elementData, index,
numMoved);
// 4.让最后个元素的索引设置为空,让其被垃圾收集器回收
elementData[--size] = null; // clear to let GC do its work
return oldValue;
}
System.java调用本地方法进行数组复制
public final class System {
public static native void arraycopy(Object src, int srcPos,
Object dest, int destPos,
int length);
}