1、new ArrayList时
//DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {}
//相当于new ArrayList(0)
public ArrayList() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
//相当于new 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()
public boolean add(E e) {
ensureCapacityInternal(size + 1); // Increments modCount!!
elementData[size++] = e;
return true;
}
private void ensureCapacityInternal(int minCapacity) {
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
}
ensureExplicitCapacity(minCapacity);
}
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
// overflow-conscious code
if (minCapacity - elementData.length > 0)
grow(minCapacity);
}
add方法
确保内部容量足够size + 1,size为当前Arraylist元素的个数
将元素放到对应的下标
返回true
ensureCapacityInternal方法与ensureExplicitCapacity是确保数组扩容到指定的大小
grow方法
private void grow(int minCapacity) {
//之前的容量
int oldCapacity = elementData.length;
//新的容量为之前的容量 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);
}
简单来说就是在增长数组的时候,与所需的最小的容量进行比较
保证要扩容的大小大于最小满足的容量
如果已经大于了最大的数组大小,再做一次最大的容量处理