public abstract class AbstractList<E>{
//操作数:元素个数发生改变时,改变了才++
//作用:对集合操作(添加、删除)一次,就++一次
protected transient int modCount = 0;//
}
public class ArrayList<E> extends AbstractList<E> implements List<E>{
//默认初始化容量
private static final int DEFAULT_CAPACITY = 10;
//空内容的数组(长度为0)
private static final Object[] EMPTY_ELEMENTDATA = {};
//空内容的数组(长度为0)
private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
//容器(ArrayList集合中所有的元素都是存在这个一维数组里的)
transient Object[] elementData;//new Object[10]
//元素个数(指针)
private int size;//2
//数组最大容量
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
public ArrayList() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
//initialCapacity
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);
}
}
//e - xxx
public boolean add(E e) {
ensureCapacityInternal(size + 1);
elementData[size++] = e;
return true;
}
//minCapacity
private void ensureCapacityInternal(int minCapacity) {
//使用无参构造创建对象时,第一次添加元素就会进入的判断
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
//minCapacity
minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
}
ensureExplicitCapacity(minCapacity);
}
//minCapacity
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
// 有溢出意识的代码 -- 判断是否可以扩容(要扩容的长度必须大于原数组的长度)
if (minCapacity - elementData.length > 0)
grow(minCapacity);
}
//minCapacity
private void grow(int minCapacity) {
// 有溢出意识的代码 -- 计算扩容的容量
//oldCapacity -
int oldCapacity = elementData.length;
//newCapacity
int newCapacity = oldCapacity + (oldCapacity >> 1);
//newCapacity
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;
}
}