以jdk1.8为例:
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;
}
ArrayList 有2个构造方法(实际上还有一种以collection带参的构造方法,这里不做描述),一个是带参和不带参的,带参构造方法会创建一个指定容量的数组,(若指定参数为0,则会创建 EMPTY_ELEMENTDATA 默认的属性数组 ,容量为零。)不带参会创建一个 DEFAULTCAPACITY_EMPTY_ELEMENTDATA 的属性数组,容量也为0。
EMPTY_ELEMENTDATA 和DEFAULTCAPACITY_EMPTY_ELEMENTDATA 源码如下:
private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
private static final Object[] EMPTY_ELEMENTDATA = {};
当我们创建好ArrayList对象执行add()方法时,它都会调用ensureCapacityInternal(int minCapacity)
public void add(int index, E element) {
rangeCheckForAdd(index);
ensureCapacityInternal(size + 1); // Increments modCount!!
System.arraycopy(elementData, index, elementData, index + 1,
size - index);
elementData[index] = element;
size++;
}
private static int calculateCapacity(Object[] elementData, int minCapacity) {
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
return Math.max(DEFAULT_CAPACITY, minCapacity);
}
return minCapacity;
}
private void ensureCapacityInternal(int minCapacity) {
ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
}
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
// overflow-conscious code
if (minCapacity - elementData.length > 0)
grow(minCapacity);
}
可以看出如果使用不带参的构造方法创建ArrayList对象,它将会扩容 DEFAULT_CAPACITY =10
/**
* Default initial capacity.
*/
private static final int DEFAULT_CAPACITY = 10;
之后,如果数组长度不够,即minCapacity - elementData.length > 0 ,执行grow()方法,这是扩容的主要逻辑部分。
private void grow(int minCapacity) {
// overflow-conscious code
int oldCapacity = elementData.length;
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);
}
可以看出若数组长度不够,数组会在原有基础上加0.5倍,(右移1位)。
使用有参构造法创建ArrayList对象时,依照grow()方法的扩容逻辑,当初始化数组长度为0,1时都是在原基础上+1,直到长度大于等于2是才是1.5倍扩容,当然(2的1.5倍是3,3的1.5倍去除小数点为4)也可以讲当初始化数组长度为0,1,2,3时都是在原基础上+1,直到长度大于等于4是才是1.5倍扩容.
有不足的地方请大家加以改正。