ArrayList源码

ArrayList源码

1.第一次创建对象

//实列话ArrayList初始化一个空数组
public ArrayList() {
    this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}

2.第一次添加add方法

public boolean add(E e) {
    ensureCapacityInternal(size + 1);  // Increments modCount!!
    //为数组赋值
    elementData[size++] = e;
    return true;
}

3.ensureCapacityInternal方法

 private void ensureCapacityInternal(int minCapacity) {
       //此时数组还是空
        ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
    }

4.calculateCapacity计算数组容量

private static int calculateCapacity(Object[] elementData, int minCapacity) {
    if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
        //计算最小容量为minCapacity10
        return Math.max(DEFAULT_CAPACITY, minCapacity);
    }
    return minCapacity;
}

5.ensureExplicitCapacity方法

private void ensureExplicitCapacity(int minCapacity) {
   //操作一次
    modCount++;

    // overflow-conscious code
     //最小容量大于数组长度
    if (minCapacity - elementData.length > 0)
        grow(minCapacity);
}

6.进入 grow(minCapacity)实现第一次扩容

private void grow(int minCapacity) {
    // overflow-conscious code
    int oldCapacity = elementData.length;
    int newCapacity = oldCapacity + (oldCapacity >> 1);
   //此时新容量为10
    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);
}

7.第二次扩容还是调用grow方法

//oldCapacity >> 1 先当于10/2
int newCapacity = oldCapacity + (oldCapacity >> 1);

8.这里在原数组增加到15个容量

elementData = Arrays.copyOf(elementData, newCapacity);