ArrayList源码扩容机制

最新推荐文章于 2024-08-07 16:14:14 发布

熊小弟弟弟

最新推荐文章于 2024-08-07 16:14:14 发布

阅读量99

点赞数

本文链接：https://blog.csdn.net/wuzhangxiong123/article/details/110499029

版权

复习多线程然后看了一下ArrayList源码扩容机制
在这之前首先看一下ArrayList的主要参数

private static final long serialVersionUID = 8683452581122892189L;

/**
 * Default initial capacity.
 */
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

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

ArrayList常用的构造方法包括两个，一个是无参构造一个是无参构造，其中有参构造传值为ArrayList中Object数据的初始化长度

public ArrayList(int initialCapacity) {
    if (initialCapacity > 0) {//初始容量大于0
             //创建initialCapacity大小的数组
        this.elementData = new Object[initialCapacity];
    } else if (initialCapacity == 0) {//初始容量等于0
        this.elementData = EMPTY_ELEMENTDATA;//创建空数组
    } else {//初始容量小于0，抛出异常
        throw new IllegalArgumentException("Illegal Capacity: "+
                                           initialCapacity);
    }
}

/**
 * Constructs an empty list with an initial capacity of ten.
 */默认构造函数，使用初始容量10构造一个空列表(无参数构造)
public ArrayList() {
    this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}

从源码中我们可以看出，无参构造其实就是创建了一个空数组，而有参构造则是创建一个指定长度的数据，分为三种情况

当initialCapacity>0时候创建一个长度为initialCapacity的Object数组
当initialCapacity=0时创建一个空数组
当initialCapacity<0时就将会跑出一个参数异常
实际的ArrayList是在添加元素中进行的，包括add和addall方法，这里以add方法为例

/**
 * Appends the specified element to the end of this list.
 *
 * @param e element to be appended to this list
 * @return <tt>true</tt> (as specified by {@link Collection#add})
 */
public boolean add(E e) {
//添加元素之前，先调用ensureCapacityInternal方法
    ensureCapacityInternal(size + 1);  // Increments modCount!!
    //这里看到ArrayList添加元素的实质就相当于为数组赋值
    elementData[size++] = e;
    return true;
}

/**
 * Appends all of the elements in the specified collection to the end of
 * this list, in the order that they are returned by the
 * specified collection's Iterator.  The behavior of this operation is
 * undefined if the specified collection is modified while the operation
 * is in progress.  (This implies that the behavior of this call is
 * undefined if the specified collection is this list, and this
 * list is nonempty.)
 *
 * @param c collection containing elements to be added to this list
 * @return <tt>true</tt> if this list changed as a result of the call
 * @throws NullPointerException if the specified collection is null
 */
public boolean addAll(Collection<? extends E> c) {
    Object[] a = c.toArray();
    int numNew = a.length;
    ensureCapacityInternal(size + numNew);  // Increments modCount
    System.arraycopy(a, 0, elementData, size, numNew);
    size += numNew;
    return numNew != 0;
}

当我们去添加一个数据的时候ArrayList首先会对数组大小进行一个校验，add方法中将期望的最小长度设定为size+1，而addAll方法中则设定为size+numNew

// 得到最小扩容量
private static int calculateCapacity(Object[] elementData, int minCapacity) {
    if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
    // 获取默认的容量和传入参数的较大值
        return Math.max(DEFAULT_CAPACITY, minCapacity);
    }
    return minCapacity;
}

private void ensureCapacityInternal(int minCapacity) {
    ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
}
//判断是否需要扩容
private void ensureExplicitCapacity(int minCapacity) {
    modCount++;

    // overflow-conscious code
    if (minCapacity - elementData.length > 0)
    //调用grow方法进行扩容，调用此方法代表已经开始扩容了
        grow(minCapacity);
}

在这里首先会对当前数组进行一个判断，如果不是默认的空数组那么就直接返回期望的最小容量，否则就会对数组长度设置一个初始值，这里还有两种情况，如果是调用的add方法那么期望的最小长度肯定是1，这时候就会将数组minCapacity初始化为10，如果是addAll方法那么这个初始值可能就会超过10，这时候机会使用minCapacity作为数组的初始长度。

之后再去判断初始化的最小期望容量是否大于当前数组的长度，如果是那么就进行扩容

/**
 * Increases the capacity to ensure that it can hold at least the
 * number of elements specified by the minimum capacity argument.
 *
 * @param minCapacity the desired minimum capacity
 */
private void grow(int minCapacity) {
    // overflow-conscious code
    // oldCapacity为旧容量，newCapacity为新容量
    int oldCapacity = elementData.length;
   //将oldCapacity 右移一位，其效果相当于oldCapacity /2，
//我们知道位运算的速度远远快于整除运算，整句运算式的结果就是将新容量更新为旧容量的1.5倍，
    int newCapacity = oldCapacity + (oldCapacity >> 1);
    //然后检查新容量是否大于最小需要容量，若还是小于最小需要容量，那么就把最小需要容量当作数组的新容量，
    if (newCapacity - minCapacity < 0)
        newCapacity = minCapacity;
         //如果新容量大于 MAX_ARRAY_SIZE,进入(执行) `hugeCapacity()` 方法来比较 minCapacity 和 MAX_ARRAY_SIZE，
    //如果minCapacity大于最大容量，则新容量则为`Integer.MAX_VALUE`，否则，新容量大小则为 MAX_ARRAY_SIZE 即为 `Integer.MAX_VALUE - 8`。
    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);
}