ArrayList源码阅读

以及

 

我的理解，其实ArrayList是一个对里面数组的封装，成员变量有以下几个

private static final long serialVersionUID = 8683452581122892189L;

    /**
     * 默认数组容量
     */
    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

    /**
     * ArrayList的大小
     *
     * @serial
     */
    private int size;

注意到里面有两个空数组EMPTY_ELEMENTDATA 和DEFAULTCAPACITY_EMPTY_ELEMENTDATA，这两者有什么区别，我们可以看代码

public ArrayList() {
        this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
    }

以及

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

可以看到无参构造函数ArrayList返回的是DEFAULTCAPACITY_EMPTY_ELEMENTDATA数组，然后calculateCapacity里面可知，如果elementData是DEFAULTCAPACITY_EMPTY_ELEMENTDATA时，那么我们返回的其实是minCapacity和DEFAULT_CAPACITY(=10)的最大值，那么这个calculateCapacity方法是在哪里调用的呢?

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


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

可知add方法里面调用ensureCapacityInternal，然后ensureCapacityInternal调用calculateCapacity, 所以就是当add的时候会先检查当前Capacity是否足够，如果ArrayList之前是通过new ArrayList<>()方法创建的list，在add的时候会默认把Capacity设置为DEFAULT_CAPACITY，如果是通过new ArrayList<>(5)创建的话，那么在add的时候就会把Capacity设置为5，在add的时候都先检查一下容量，有点按需分配，延迟加载的感觉。同时我们看到上文还有一个方法ensureExplicitCapacity, 点进去看: 

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

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

modCount是个啥？？？？

 

点进grow:

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

这里的意思就是，如果容量不够，就把数组多加原来的0.5(右移操作)，也就是容量变为原来的1.5倍，然后赋值给newCapacity，并且对newCapacity进行检查，查看hugeCapacity:

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

可知Arraylist数组大小最大为Integer.MAX_VALUE，在确定newCapacity大小以后，我们会新生成一个Object[newCapacity]数组，然后把老的elementData copy到新数组里面