手撕ArrayList底层源码
public abstract class AbstractList<E> extends AbstractCollection<E> implements List<E> {
//操作数 -- 记录添加、删除数据的次数
protected transient int modCount = 0;//2
}
public class ArrayList<E> extends AbstractList<E> implements List<E>{
//初始化容量
private static final int DEFAULT_CAPACITY = 10;
//空内容的数组
private static final Object[] EMPTY_ELEMENTDATA = {};
//默认初始化的空内容的数组
private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};
//数组容器
transient Object[] elementData;//new Object[10] - ["刘备",null,null,...]
//元素个数/指针
private int size;//1
//数组最大容量
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
//无参构造
public ArrayList() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
//有参构造 -- initialCapacity - 100
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 - 关羽
public boolean add(E e) {
ensureCapacityInternal(size + 1);
elementData[size++] = e;
return true;
}
//minCapacity - 11
private void ensureCapacityInternal(int minCapacity) {
//使用无参构造创建ArrayList,并第一次添加元素时进入的判断
if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
//minCapacity - 10
minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
}
ensureExplicitCapacity(minCapacity);
}
//minCapacity - 11
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
// 有溢出意识的代码(minCapacity必须比数组容器要更大,才扩容)
if (minCapacity - elementData.length > 0)
grow(minCapacity);
}
// minCapacity - 11
private void grow(int minCapacity) {
// 有溢出意识的代码(获取有效数组新长度)
int oldCapacity = elementData.length;
int newCapacity = oldCapacity + (oldCapacity >> 1);//ArrayList的扩容机制
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);
}
}
ArrayList<String> list = new ArrayList<>();
//ArrayList<String> list = new ArrayList<>(100);
//添加元素
list.add("刘备");
list.add("关羽");
list.add("张飞");
list.add("诸葛亮");
- ArrayList的底层数据结构是什么?
Object类型的一维数组
- ArrayList默认初始化容量是多少?
默认初始化容量是10
- ArrayList数组容量最大是多少?
初始化容量最大值是Integer.MAX_VALUE-8
- ArrayList数组容量最大为什么是Integer.MAX_VALUE-8?
减8的位置是为了保存数组的一些头部信息(元素类型、内存地址…)
- ArrayList的扩容机制是什么?
是原来长度的1.5倍