ArrayList扩容机制

ArrayList构造函数 

//存储元素
transient Object[] elementData;

//扩容时使用
private static final Object[] EMPTY_ELEMENTDATA = {};

//元素的个数
private int size;
//默认容量大小
private static final int DEFAULT_CAPACITY = 10;

1.无参构造函数
public ArrayList() {
    super();
    //elementData 是一个长度为0的数组 会在添加的时候进行扩容
    this.elementData = EMPTY_ELEMENTDATA;
}

2.带集合的构造
public ArrayList(Collection<? extends E> c) {
    elementData = c.toArray();
    size = elementData.length;
    // c.toArray might (incorrectly) not return Object[] (see 6260652)
    if (elementData.getClass() != Object[].class)
        elementData = Arrays.copyOf(elementData, size, Object[].class);
}

3.初始化容量的构造函数
public ArrayList(int initialCapacity) {
    super();
    if (initialCapacity < 0)
        throw new IllegalArgumentException("Illegal Capacity: "+
                                           initialCapacity);
    //构建一个初始化容量为initialCapacity的数组
    this.elementData = new Object[initialCapacity];
}

/**
 * 添加元素的时候扩容
 */
public boolean add(E e) {
    //扩容机制 
    //容量加1
    ensureCapacityInternal(size + 1);  // Increments modCount!!
    elementData[size++] = e;
    return true;
}

private void ensureCapacityInternal(int minCapacity) {
   //判断是否为第一次添加数据 选最大的数作为容量
    if (elementData == EMPTY_ELEMENTDATA) {
        minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
    }
    //扩容
    ensureExplicitCapacity(minCapacity);
}
//
private void ensureExplicitCapacity(int minCapacity) {
    modCount++;
    //判断容量是否大于已存元素的
    if (minCapacity - elementData.length > 0)
        //扩容
        grow(minCapacity);
}

//扩容
private void grow(int minCapacity) {
    // overflow-conscious code
    int oldCapacity = elementData.length;
    //扩容算法 已存元素的长度向右移一位 加上 已存元素的长度 相当于1.5倍加1 
    int newCapacity = oldCapacity + (oldCapacity >> 1);
    //若构造函数没有定义容量大小 会在这里进行初始化 第一次添加elementData长度为0 minCapacity 为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);
}