ArrayList 使用无参构造方法数创建时会创建一个没有长度的数组,当是第一次使用add方法的时候会在原数组的长度+1和默认长度进行比较(10)如果小于10把数组扩容到10如果大于10,则扩容到原来数组的1.5被。如果数组的长度大于数组默认的最大值 (2147483647-8)就把他的长度扩容到int的最大值 然后在把存入的元素放入最后一位
/**
* 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
private static final int DEFAULT_CAPACITY = 10;
private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
/**
* Constructs an empty list with an initial capacity of ten.
* 默认无参的构造方法,
*/
public ArrayList() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
//ArrayList的添加元素的方法
public boolean add(E e) {
//对数组进行扩容
ensureCapacityInternal(size + 1); // Increments modCount!!
elementData[size++] = e;
return true;
}
如果数组扩容后的长度大于10返回新扩容的长度,如果不大于返回10
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++;//不知道是干啥的这个是ArrayList的父类中的变量
//如果扩容后的长度大于 原来的长度执行grow方法
//如果不大于0 说明数组还有空间可以存储数据
// 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);//新的数组长度是原数组的长度+原数组长度的一半
//新的数组的长度没有size+1 或者 默认长度 长
if (newCapacity - minCapacity < 0)
newCapacity = minCapacity;
//新数组的长度大于 数组长度默认最大值 最大值是int的最大值-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);
}
//如果新数组的长度大于数组的默认最大值 把他扩容到 int的最大值
private static int hugeCapacity(int minCapacity) {
if (minCapacity < 0) // overflow
throw new OutOfMemoryError();
return (minCapacity > MAX_ARRAY_SIZE) ?
Integer.MAX_VALUE :
MAX_ARRAY_SIZE;
}