简介
ArrayList是可变数组,实现了List接口。
ArrayList是基于数组实现,其内部维护了一个Object数组:
transient Object[] elementData; // non-private to simplify nested class access
同时维护了一个size属性,表示当前的元素个数。这样,isEmpty(),size()等操作都可以常数时间。
private int size;
ArrayList默认的初始容量是10,随着元素不断加入,会自动扩容,这时实现动态数组的关键。
private static final int DEFAULT_CAPACITY = 10;
public ArrayList() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
也可以在构造函数传入初始容量,如果能预计到ArrayList的容量,可以省去扩容的开销。
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);
}
}
add方法
add方法被一通重构后,逻辑变得非常清晰:add方法的前置条件是内部数组的容量不小于size+1;后置条件是size加1。
public boolean add(E e) {
ensureCapacityInternal(size + 1); // Increments modCount!!
elementData[size++] = e;
return true;
}
ensureCapacityInternal方法保证内部容量不小于minCapacity:
private void ensureCapacityInternal(int minCapacity) {
ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
}
private static int calculateCapacity(Object[] elementData, int minCapacity) {
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
return Math.max(DEFAULT_CAPACITY, minCapacity);
}
return minCapacity;
}
不小于minCapacity,那具体是多少合适呢?且看ensureExplicitCapacity方法。
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
// overflow-conscious code
if (minCapacity - elementData.length > 0)
grow(minCapacity);
}
关键是grow方法,它保证新的容量最少为就容量的1.5倍,防止不停的扩容。为什么是1.5倍呢?这是一种指数增长策略,在不知道具体情况时,指数增长策略是比较好的选择。
private void grow(int minCapacity) {
// overflow-conscious code
int oldCapacity = elementData.length;
int newCapacity = oldCapacity + (oldCapacity >> 1);//1.5倍
if (newCapacity - minCapacity < 0)
newCapacity = minCapacity;//1.5倍不够就用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);
}
remove方法
remove方法特别之处在于可能需要移动元素。
public E remove(int index) {
rangeCheck(index);
modCount++;
E oldValue = elementData(index);
int numMoved = size - index - 1;
if (numMoved > 0)
System.arraycopy(elementData, index+1, elementData, index,
numMoved);
elementData[--size] = null; // clear to let GC do its work
return oldValue;
}
//这里有个System的方法,native实现的,效率更高:
public static native void arraycopy(Object src, int srcPos,
Object dest, int destPos,
int length);