ArrayList:
构造函数:初始化一个elementData数组,容量可以自行设置,默认为10。
size():返回存入的对象的数目。
扩容:
public void ensureCapacity(int minCapacity) {
modCount++;
int oldCapacity = elementData.length;
if (minCapacity > oldCapacity) {
Object oldData[] = elementData;
int newCapacity = (oldCapacity * 3)/2 + 1;
if (newCapacity < minCapacity)
newCapacity = minCapacity;
// minCapacity is usually close to size, so this is a win:
elementData = Arrays.copyOf(elementData, newCapacity);
}
}
如果minCapacity > oldCapacity,newCapacity = (oldCapacity * 3)/2 + 1,然后比较newCapacity与minCapacity,newCapacity为较大的,然后通过完成扩容Arrays.copyOf(elementData, newCapacity)完成扩容。
Arrays.copyOf(elementData, newCapacity):产生一个newCapacity大小的数组(与elementData中存的对象类型相同),然后调用系统方法完成扩容。
Vector:
构造函数:初始化一个elementData数组,容量可以自行设置,默认为10。(capacityIncrement参数(扩容用)可自行设置,默认为0)
扩容:
private void ensureCapacityHelper(int minCapacity) {
int oldCapacity = elementData.length;
if (minCapacity > oldCapacity) {
Object[] oldData = elementData;
int newCapacity = (capacityIncrement > 0) ?
(oldCapacity + capacityIncrement) : (oldCapacity * 2);
if (newCapacity < minCapacity) {
newCapacity = minCapacity;
}
elementData = Arrays.copyOf(elementData, newCapacity);
}
}
如果minCapacity > oldCapacity,判断capacityIncrement 是否大于0,大于0则newCapacity = oldCapacity + capacityIncrement;<=0则newCapacity = oldCapacity*2;
然后比较newCapacity与minCapacity,newCapacity为较大的,然后通过完成扩容Arrays.copyOf(elementData, newCapacity)完成扩容。
Arrays.copyOf(elementData, newCapacity):产生一个newCapacity大小的数组(与elementData中存的对象类型相同),然后调用系统方法完成扩容。
LinkedList:
header.next = header.previous = header;
}