Java ArrayList容量及扩容方式，arraylist扩容

查看JDK1.8 ArrayList的源代码：

1、默认初始容量为10

    /**
     * Default initial capacity.
     */
    private static final int DEFAULT_CAPACITY = 10;

2、最大容量为 Integer.MAX_VALUE - 8

    /**
     * The maximum size of array to allocate.
     * Some VMs reserve some header words in an array.
     * Attempts to allocate larger arrays may result in
     * OutOfMemoryError: Requested array size exceeds VM limit
     */
    private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;

原因：之前参考别人的，有待求证：

         数组对象有一个额外的元数据，用于表示数组的大小；

         数组长度size为int类型，共32位，有一位符号位，所以最大长度为Integer.MAX_VALUE=2^31= 2,147,483,648；

         8bytes用来存储size； 

3、扩容方式：

             （1）首先传递进来一个希望的最小容量minCapacity；

             （2）新容量newCapacity = oldCapacity + (oldCapacity >> 1)，即新容量等于原容量的1.5倍；

             （3）如果minCapacity  >  newCapacity ，newCapacity =  minCapacity ;

               (4)   如果 newCapacity > 最大容量 MAX_ARRAY_SIZE ，newCapacity = hugeCapacity(minCapacity);

               (5)   以新容量拷贝原数据

    /**
     * Increases the capacity to ensure that it can hold at least the
     * number of elements specified by the minimum capacity argument.
     *
     * @param minCapacity the desired minimum capacity
     */
    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);
    }

    private static int hugeCapacity(int minCapacity) {
        if (minCapacity < 0) // overflow
            throw new OutOfMemoryError();
        return (minCapacity > MAX_ARRAY_SIZE) ?
            Integer.MAX_VALUE :
            MAX_ARRAY_SIZE;
    }