1.ArrayList的add方法
ArrayList<Object> list = new ArrayList<>();
list.add("张三");
list.add("李四");
list.add("王五");
2.在add方法中,调用 ensureCapacityInternal()方法,size默认private int size;所以size为0,
那么传递给ensureCapacityInternal的参数值是1
public boolean add(E e) {
ensureCapacityInternal(size + 1); // Increments modCount!!
elementData[size++] = e;
return true;
}
3.在ensureCapacityInternal方法中,判断elementData和DEFAULTCAPACITY_EMPTY_ELEMENTDATA是否相等,因为是第一次添加所以是相等的,那么久给minCapacity赋初值为10(通过max方法可得出)
private void ensureCapacityInternal(int minCapacity) {
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
}
ensureExplicitCapacity(minCapacity);
}
4.//在ensureExplicitCapacity方法中,判断minCapacity (值为10)是否大于elementData.length,显然是大于的,所以进入方法grow(10)
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
// overflow-conscious code
if (minCapacity - elementData.length > 0)
grow(minCapacity);
}
5.该方法涉及ArrayList的扩容,重要
private void grow(int minCapacity) {
// overflow-conscious code
int oldCapacity = elementData.length;//elementData.length大小为0
//右移一位还是为0.右移几位相当于除以2的几次幂,左移相当于乘以2的几次幂
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 到此时才被赋初值且大小是10
elementData = Arrays.copyOf(elementData, newCapacity);
}
6.elementData[size++] = e;即往数组大小为10的数组中,索引为0的下标下添加元素。size大小在计算完成后会自增