ArrayList

源码解析

public class ArrayList<E> extends AbstractList<E>
        implements List<E>, RandomAccess, Cloneable, java.io.Serializable

ArrayList继承至AbstractList，实现了List，RamdomAccess，Cloneable，Serializable接口。
List:列表，支持add、remove、contains等一系列方法，不用多说
RandomAccess：源码+百度，发现它用来标记实现的List集合具备快速随机访问的能力。用RandomAccess标记的集合类（ArrayList）使用for循环速度最快，没有的话使用Iterator访问最快。
Serializable：序列化，不用多说
Cloneable：拷贝

变量

	private static final long serialVersionUID = 8683452581122892189L;
    /**
     * Default initial capacity.
     */
    private static final int DEFAULT_CAPACITY = 10;
    /**
     * Shared empty array instance used for empty instances.
     */
    private static final Object[] EMPTY_ELEMENTDATA = {};
    /**
     * Shared empty array instance used for default sized empty instances. We
     * distinguish this from EMPTY_ELEMENTDATA to know how much to inflate when
     * first element is added.
     */
    private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
    /**
     * The array buffer into which the elements of the ArrayList are stored.
     * The capacity of the ArrayList is the length of this array buffer. Any
     * empty ArrayList with elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA
     * will be expanded to DEFAULT_CAPACITY when the first element is added.
     */
    transient Object[] elementData; // non-private to simplify nested class access
    /**
     * The size of the ArrayList (the number of elements it contains).
     *
     * @serial
     */
    private int size;

serialVersionUID ：序列化UID，不用多说
DEFAULT_CAPACITY ：默认初始容量大小
EMPTY_ELEMENTDATA 和 DEFAULTCAPACITY_EMPTY_ELEMENTDATA 都是默认的空数组，源码我理解如下：当进行扩容时EMPTY_ELEMENTDATA 会基于你设置的初始容量大小进行1.5倍扩容而DEFAULTCAPACITY_EMPTY_ELEMENTDATA 则基于10进行1.5倍扩容。核心代码如下：

    private void ensureCapacityInternal(int minCapacity) {
        if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
            minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
        }

        ensureExplicitCapacity(minCapacity);
    }

elementData：保存ArrayList数据
size：ArrayList大小

构造函数

/**
     * Constructs an empty list with the specified initial capacity.
     *
     * @param  initialCapacity  the initial capacity of the list
     * @throws IllegalArgumentException if the specified initial capacity
     *         is negative
     */
    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);
        }
    }

    /**
     * Constructs an empty list with an initial capacity of ten.
     */
    public ArrayList() {
        this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
    }

    /**
     * Constructs a list containing the elements of the specified
     * collection, in the order they are returned by the collection's
     * iterator.
     *
     * @param c the collection whose elements are to be placed into this list
     * @throws NullPointerException if the specified collection is null
     */
    public ArrayList(Collection<? extends E> c) {
        elementData = c.toArray();
        if ((size = elementData.length) != 0) {
            // c.toArray might (incorrectly) not return Object[] (see 6260652)
            if (elementData.getClass() != Object[].class)
                elementData = Arrays.copyOf(elementData, size, Object[].class);
        } else {
            // replace with empty array.
            this.elementData = EMPTY_ELEMENTDATA;
        }
    }

构造函数没啥好说的，比较简单，只需要注意无参构造函数使用的是DEFAULTCAPACITY_EMPTY_
ELEMENTDATA，后续扩容的默认初始值为10。

扩容机制

其他函数中较为重要的就是ArrayList的扩容机制。
无参构造的ArrayList为例：

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

调用add函数添加单个元素时，首先调用 ensureCapacityInternal()，ensureCapacityInternal会继续调用ensureExplicitCapacity，这里需要详细说明，先贴源码。

    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时，ensureCapacityInternal的参数为1，elementData == DEFAULTCAPACITY_EMPTY
_ELEMENTDATA通过，传入ensureExplicitCapacity的参数为10，minCapacity - elementData.length > 0成立，进入grow方法扩容。
当第二次add时，ensureCapacityInternal的参数为2，elementData == DEFAULTCAPACITY_EMPTY
_ELEMENTDATA不通过，此时传入ensureExplicitCapacity的参数为2，elementData.length经过第一次扩容已经为10，minCapacity - elementData.length > 0不成立，不进入grow方法。
一直到第十一次add时，ensureCapacityInternal的参数为11，传入ensureExplicitCapacity的参数为11，minCapacity - elementData.length > 0成立，进入grow方法扩容。
接着说明grow方法

    private void grow(int minCapacity) {
        // overflow-conscious code
        //获取当前数组的长度
        int oldCapacity = elementData.length;
        //通过位运算将当前数组长度*1.5赋给newCapacity
        int newCapacity = oldCapacity + (oldCapacity >> 1);
        //如果数组长度*1.5仍然小于需要的最小容量，则把最小容量作为新的扩容长度newCapacity
        if (newCapacity - minCapacity < 0)
            newCapacity = minCapacity;
        //比较newCapacity和最大容量MAX_ARRAY_SIZE(Integer.MAX_VALUE - 8)的大小，如果超过最大容量，则进行hugeCapacity;
        if (newCapacity - MAX_ARRAY_SIZE > 0)
            newCapacity = hugeCapacity(minCapacity);
        // minCapacity is usually close to size, so this is a win:
        //将原数组复制到新的newCapacity长度的数组中并返回
        elementData = Arrays.copyOf(elementData, newCapacity);
    }

以上为自己对ArrayList部分源码的理解，如有错误欢迎大家指正