java ArrayList

1. java集合框架的结构图

图上的ArrayList机实现了List接口，但是查看源码如下

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

ArrayList继承了AbstractList，实现了List<E>, RandomAccess, Cloneable, java.io.Serializable接口

2.ArrayList初始化容量为10

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

3. ArrayList底层为数组实现

/**
     * 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

4. size属性值为当前数组存放数据个数

/**
     * The size of the ArrayList (the number of elements it contains).
     *
     * @serial
     */
    private int size;

5.ArrayList得构造方法：

  a.无参构造函数，直接引用一个未得到数组初始化得数组

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

  b.指定容量的有参构造函数，initialCapacity为初始化容量，源码可知：

     如果初始话容量大于0，直接进行初始化。

     如果等于0，则直接进行空数组得引用。

    如果小于0，则直接异常

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);
        }
    }

c.参数为集合，将集合转化为数组，如果长度为0，则直接引用空数组。如果不为0则构造一个包含指定Collention 元素的列表

    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;
        }
    }

6. trimToSize方法，将ArrayList转化为实际长度得数组：

    public void trimToSize() {
        modCount++;
        if (size < elementData.length) {
            elementData = (size == 0)
              ? EMPTY_ELEMENTDATA
              : Arrays.copyOf(elementData, size);
        }
    }

例如：初始化一个ArrayList，初始容量为10，但是只向集合中添加一个值，这时数组得长度为10，但是size为1，此方法就是让数组length和size保持一致

7.add方法：

首先进行容量校验，然后再当前数组实际长度的下一位添加数据

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

此方法是判断数组容量，参数为 : 实际大小+1,

    private void ensureCapacityInternal(int minCapacity) {
        ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
    }

如果当前数组为空数组，则比较 size+1 和 默认大小10 ，取大得值，返回得值将传给下面得方法

    private static int calculateCapacity(Object[] elementData, int minCapacity) {
        if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
            return Math.max(DEFAULT_CAPACITY, minCapacity);
        }
        return minCapacity;
    }

如果获取到得大小大于当前数组得长度，则需要根据获得到的数组大小进行扩容，扩容方法如下

    private void ensureExplicitCapacity(int minCapacity) {
        modCount++;

        // overflow-conscious code
        if (minCapacity - elementData.length > 0)
            grow(minCapacity);
    }

首先获取当前数组得长度，然后计算出新数组得长度为：old+old*0.5,然后进行数组拷贝，指向新数组

    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);
    }

8. 删除元素：

a.按照位置删除元素

首先利用rangeCheck方法判断index与size得大小，如果index大于size，那么直接报错。

然后获取指定下标得值，计算移动得是第几个元素，然后进行数组拷贝，将需要删除得元素放在最后，赋值为nu'l'l

    public E remove(int index) {
        rangeCheck(index);

        modCount++;
        E oldValue = elementData(index);

        int numMoved = size - index - 1;
        if (numMoved > 0)
            System.arraycopy(elementData, index+1, elementData, index,
                             numMoved);
        elementData[--size] = null; // clear to let GC do its work

        return oldValue;
    }

b.按照值删除元素

首先判断要移除得元素是否为空，如果为空，则寻找第一个为空的元素，删除。不为空也同样是进行查找后进行删除

    public boolean remove(Object o) {
        if (o == null) {
            for (int index = 0; index < size; index++)
                if (elementData[index] == null) {
                    fastRemove(index);
                    return true;
                }
        } else {
            for (int index = 0; index < size; index++)
                if (o.equals(elementData[index])) {
                    fastRemove(index);
                    return true;
                }
        }
        return false;
    }

    private void fastRemove(int index) {
        modCount++;
        int numMoved = size - index - 1;
        if (numMoved > 0)
            System.arraycopy(elementData, index+1, elementData, index,
                             numMoved);
        elementData[--size] = null; // clear to let GC do its work
    }

9. 清空ArrayList

    循环置空

    public void clear() {
        modCount++;

        // clear to let GC do its work
        for (int i = 0; i < size; i++)
            elementData[i] = null;

        size = 0;
    }