java8 arraylist原理

1. 初始化

Arralist初始化如果不填入参数，则默认采用空数组初始化，如果携带参数，则采用初始化参数。初始容量为0，首次增加后为10

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

2. 数组增加数据

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

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

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

}
  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)
        	//最大大小为integermax - 8
            newCapacity = hugeCapacity(minCapacity);
        // minCapacity is usually close to size, so this is a win:
        elementData = Arrays.copyOf(elementData, newCapacity);
    }

当数组大小不够的时候进行扩容。

3. 清除数据

 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);
        //将–size上的位置赋值为null，让gc(垃圾回收机制)更快的回收它。
        elementData[--size] = null; // clear to let GC do its work

        return oldValue;
    }

4. 插入数据

public void add(int index, E element) {
        rangeCheckForAdd(index);
		//计算是否需要扩容
        ensureCapacityInternal(size + 1);  // Increments modCount!!
        //把元素后移
        System.arraycopy(elementData, index, elementData, index + 1,
                         size - index);
        //插入元素
        elementData[index] = element;
        size++;
    }