常量和属性:
//默认初始化容量
private static final int DEFAULT_CAPACITY = 10;
//属性 可变数组
transient Object[] elementData;
//属性 可变数组中有效元素的长度
private int size;
new():
//空参构造
public ArrayList() {
//初始化elementData为空数组
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
//指定初始化容量
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);
}
}
add():
add的时候,
若原size为0,原数组长度为0,则size变为1,数组长度扩容为10
若原size为1,原数组长度为10,则size变为2,数组长度不变
若原size为10,原数组长度为10,则size变为11,数组长度扩容为10+5=15
若原size为11,原数组长度为15,则size变为12,数组长度不变
若原size为15,原数组长度为15,则size变为16,数组长度扩容为15+7=22
若原size为16,原数组长度为22,则size变为17,数组长度不变
······
//add
public boolean add(E e) {
//确保内部容量(根据所需最小容量)
ensureCapacityInternal(size + 1);
//size位置添加元素
elementData[size++] = e;
//返回true
return true;
}
//确保内部容量(根据所需最小容量)
private void ensureCapacityInternal(int minCapacity) {
//确保许可容量(根据所需最小容量)
ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
}
//计算所需最小容量(若默认则最小为10)
private static int calculateCapacity(Object[] elementData, int minCapacity) {
//若初始化
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
return Math.max(DEFAULT_CAPACITY, minCapacity);
}
return minCapacity;
}
//确保许可容量(根据所需最小容量)
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
//所需最小容量大于数组长度时,根据所需最小容量扩容
if (minCapacity - elementData.length > 0)
//根据所需最小容量扩容
grow(minCapacity);
}
//根据所需最小容量扩容
private void grow(int minCapacity) {
//旧容量为原数组长度
int oldCapacity = elementData.length;
//新容量为原数组的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);
}
get():
//get
public E get(int index) {
//范围检查
rangeCheck(index);
//返回index下标的元素
return elementData(index);
}
//范围检查
private void rangeCheck(int index) {
if (index >= size)
throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
}