ArrayList 详解

1.介绍

ArrayList是一个基于数组的集合实现，可以进行对元素的增删改查，可以动态的进行扩容。ArrayList并不是线程安全，所以效率比较高。

2.ArrayList 源码

 public ArrayList(int initialCapacity) {
         //如果参数大于0，则创建一个initialCapacity大小的object数组
        if (initialCapacity > 0) {
            this.elementData = new Object[initialCapacity];
        }
        //如果参数等于0，则创建一个空数组
        else if (initialCapacity == 0) {
            this.elementData = EMPTY_ELEMENTDATA;
        }
        //否则抛出异常 
        else {
            throw new IllegalArgumentException("Illegal Capacity: "+
                                               initialCapacity);
        }
    }


public ArrayList() {
        //创建一个空数组
        this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
    }

//构造函数，传入一个容器
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 {
            //创建一个空数组
            this.elementData = EMPTY_ELEMENTDATA;
        }
    }

往ArrayList增加元素，首先会检查空间是否足够，不够的话会进行1.5倍扩容，然后再添加元素

public void ensureCapacity(int minCapacity) {
        int minExpand = (elementData != DEFAULTCAPACITY_EMPTY_ELEMENTDATA)
            // any size if not default element table
            ? 0
            // larger than default for default empty table. It's already
            // supposed to be at default size.
            : DEFAULT_CAPACITY;
       //判断传入参数是否比默认大小10大
        if (minCapacity > minExpand) {
            ensureExplicitCapacity(minCapacity);
        }
    }

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

        // overflow-conscious code
        //传入参数大于数组长度，则扩容
        if (minCapacity - elementData.length > 0)
            grow(minCapacity);
    }

    private void grow(int minCapacity) {
        // overflow-conscious code
         //传入数组长度为oldCapacity
        int oldCapacity = elementData.length;
        //定义一个新的长度newCapacity=原来数组的1.5倍
        int newCapacity = oldCapacity + (oldCapacity >> 1);
        //如果新的长度小于参数传入的长度，则newCapacity等于传入参数
        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);
    }

判断好是否需要扩容之后，然后添加元素

    public boolean add(E e) {
    //检查size+1是否大于数组长度，大于就扩容
        ensureCapacityInternal(size + 1);  // Increments modCount!!
        elementData[size++] = e;
        return true;
    }