一、ArrayList() 空参
package com.li.springboot.text;
import java.util.*;
public class Text {
public static void main(String[] args) {
ArrayList arrayList = new ArrayList();
for(int i = 1;i <=10;i++){
arrayList.add(i);
}
for(int i = 11;i <= 15;i++){
arrayList.add(i);
}
}
}
1.ArrayList arrayList = new ArrayList();
public ArrayList() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
transient Object[] elementData;
2.arrayList.add(i);
public boolean add(E e) {
ensureCapacityInternal(size + 1); // size = 0
elementData[size++] = e;
return true;
}
3.ensureCapacityInternal(size + 1);
private void ensureCapacityInternal(int minCapacity) {
ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
}
4calculateCapacity(elementData, minCapacity)
private static int calculateCapacity(Object[] elementData, int minCapacity) {
//如果是第一次创建
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
//取最大值(DEFAULT_CAPACITY 底层自定义10)
return Math.max(DEFAULT_CAPACITY, minCapacity);
}
return minCapacity;//10
}
5.ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
//如果elementData.length 不够 容下最小容量minCapacity 则扩容
if (minCapacity - elementData.length > 0)
grow(minCapacity);
}
6.grow(minCapacity);
private void grow(int minCapacity) {
// overflow-conscious code
int oldCapacity = elementData.length;
int newCapacity = oldCapacity + (oldCapacity >> 1);
if (newCapacity - minCapacity < 0)
newCapacity = minCapacity;
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);
}