arraylist源码分析
按住Alt 点击ArrayList
DEFAULT_CAPACITY = 10 //默认容量大小为10
注意:如果没有向集合中添加任何元素,容量为0 添加一个元素之后容量为10
elementData //存放数组的
size //实际的元素个数
add() 添加元素 按住Alt 点击add()方法
public boolean add(E e) {
ensureCapacityInternal(size + 1); // Increments modCount!!
elementData[size++] = e;
return true;
}
按住Alt 点击 ensureCapacityInternal()方法
private void ensureCapacityInternal(int minCapacity) {
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
//minCapacity=1 DEFAULT_CAPACITY=10 Math.max(比较大的)
minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
}
//10
ensureExplicitCapacity(minCapacity);
}
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
// overflow-conscious code
// 10 -0 >0
if (minCapacity - elementData.length > 0)
// 按住Alt 点击 grow()方法
grow(minCapacity);
}
10
private void grow(int minCapacity) {
// overflow-conscious code
0 0
int oldCapacity = elementData.length;
0 oldCapacity=oldCapacity*2
0 0=0*2 0
int newCapacity = oldCapacity + (oldCapacity >> 1);
0 10
0- 10=-10<0
if (newCapacity - minCapacity < 0)
所以 newCapacity=10
newCapacity = minCapacity;
不成立
if (newCapacity - MAX_ARRAY_SIZE > 0)
newCapacity = hugeCapacity(minCapacity);
// minCapacity is usually close to size, so this is a win:
10 10
elementData = Arrays.copyOf(elementData, newCapacity);
最后得出结论 :添加一个元素之后容量为10 扩容是原来的1.5倍
}