ArrayList扩容机制

/**
 * @Author LWL
 * @Date 2022/5/19 23:40
 * @TODO ArrayList 底层是数组,初始容量为10,当容量满后会自动扩容原来的1.5倍
 */
public class ArrayListTest<E> {


    //当前数组长度
    private int size;
    //元素数据
    Object[] elementData;
    //模数
    protected transient int modCount = 0;
    //默认容量
    private static final int DEFAULT_CAPACITY = 10;
    //数组最大尺寸
    private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
    //默认容量空元素数据
    private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};


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

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

    /**
     * 无参构造创建时会把 this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA
     * 判断当前数组是否是默认构造方法生成的空数组,如果栈内存地址相同,初始化容量为10
     */
    private void ensureCapacityInternal(int minCapacity) {
        if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
            //获取当前数组下标和默认值10作比较,返回最大值
            minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
        }
        //检测容量是否需要扩容
        ensureExplicitCapacity(minCapacity);
    }


    private void ensureExplicitCapacity(int minCapacity) {
        modCount++;
        //如果新添加的元素的下标 - 当前数组的长度 > 0  则需要扩容
        if (minCapacity - elementData.length > 0) {
            grow(minCapacity);
        }
    }

    /**
     * 扩容
     */
    private void grow(int minCapacity) {
        //获取当前数组的长度(默认为10)
        int oldCapacity = elementData.length;
        // 10 + 10/2 = 1.5倍 (定义新的数组的长度)
        int newCapacity = oldCapacity + (oldCapacity >> 1);
        //如果新添加的元素的下标比扩容后的长度要长,则把新元素下标赋值给新数组的长度
        if (newCapacity - minCapacity < 0) {
            newCapacity = minCapacity;
        }
        //如果新数组长度比数组极限容量还要大,会出现内存不足错误
        if (newCapacity - MAX_ARRAY_SIZE > 0) {
            newCapacity = hugeCapacity(minCapacity);
        }
        //重点 其实扩容的核心就是新建一个扩容后的数组,然后把就数组的数据复制过去
        elementData = Arrays.copyOf(elementData, newCapacity);
    }


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


    public static void main(String[] args) {
        ArrayListTest arrayListTest = new ArrayListTest<>();
        // == 比较地址值 -> 结果为 true
        System.out.println(arrayListTest.elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA);
    }
}