前言
本文从JDK1.8源码的角度简要分析一下ArrayList的常用方法以及扩容机制,帮助我们更好的使用这个常见的集合类实现。
rep
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
/**
* The size of the ArrayList (the number of elements it contains).
*
* @serial
*/
private int size;
这里面我们用 elementData来存储数据,用size来记录到底存储了多少数据。
由此可见,ArrayList在内部是由一个数组来存储的,它获取了内存中一块连续的空间。我们知道ArrayList的大小是随着add等操作不断变化的,因此elementData数组也需要不断扩容以满足我们的需求。
扩容机制
ArrayList的扩容机制如下:
- 对于默认初始化的 new ArrayList(),我们直接为其扩容到10
- 每当当前elementData数组大小不够时,我们向内存中申请一个1.5倍大小的新数组,将原先的所有的内容拷贝到新数组当中,并添加新的Object
接下来我们看看源码,我梳理了代码结构方便大家理解:
扩容的核心代码是函数 ensureCapacityInternal(int minCapacity),其中minCapacity是当前所需要的size
//函数作用:为 new ArrayList()设置10的容量
private static int calculateCapacity(Object[] elementData, int minCapacity) {
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
return Math.max(DEFAULT_CAPACITY, minCapacity);
}
return minCapacity;
}
//函数作用,确保当前数组大小能满足 minCapacity的size
private void ensureCapacityInternal(int minCapacity) {
ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
}
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
// overflow-conscious code
if (minCapacity - elementData.length > 0)
grow(minCapacity);
}
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
/**
* 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
int oldCapacity = elementData.length;
int newCapacity = oldCapacity + (oldCapacity >> 1);//1.5倍扩容
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);
}
这里我们可以看到,为什么要设置DEFAULT_CAPACITY = 10的默认容量:如果不加设置,size从1到5,每一次都要重新申请新数组(因为1.5倍是向下取整的)。申请内存的开销是很大的,因此有必要设置默认容量为10.
基本方法
public boolean add(E e) {
ensureCapacityInternal(size + 1); // Increments modCount!!
elementData[size++] = e;
return true;
}
普通的add需要扩容
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++;
}
插入的add需要做一次数组移动,因此相对于LinkedList开销较大
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);
elementData[--size] = null; // clear to let GC do its work
return oldValue;
}
删除操作,也需要平移数组,要注意开销
public void clear() {
modCount++;
// clear to let GC do its work
for (int i = 0; i < size; i++)
elementData[i] = null;
size = 0;
}
大家还应该注意的是,ArrayList只具有扩容操作,而不具备减容操作。包括上面的clear方法。之前的我一直认为clear方法相当于重新创建数组。这里面可以发现内存隐患,删除后的ArrayList内存开销不会发生改变。