public abstract class AbstractList<E> extends AbstractCollection<E> implements List<E> {
//外部操作数(记录添加和删除的次数)
protected transient int modCount = 0;//4
}
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 = {};
//数据容器最大容量
private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
//数据容器 - [“aaa”,"bbb","ccc","ddd",null,null,null,null,null,null]
transient Object[] elementData;//new Object[10];
//元素个数
private int size;//4
public ArrayList() {
this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}
//initialCapacity - 10000
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 - "ddd"
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 = Math.max(10, 1);
minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
}
ensureExplicitCapacity(minCapacity);
}
//minCapacity - 11
private void ensureExplicitCapacity(int minCapacity) {
modCount++;
// 有溢出意识的代码(准备扩容的长度必须大于数据容器的长度)
if (minCapacity - elementData.length > 0)
grow(minCapacity);
}
//minCapacity - 11
private void grow(int minCapacity) {
// oldCapacity - 10
int oldCapacity = elementData.length;
// newCapacity - 15
int newCapacity = oldCapacity + (oldCapacity >> 1);//ArrayList的扩容机制(1.5倍)
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) // overflow
throw new OutOfMemoryError();
return (minCapacity > MAX_ARRAY_SIZE) ?
Integer.MAX_VALUE :
MAX_ARRAY_SIZE;
}
}
场景:
//ArrayList<String> list = new ArrayList<>(10000);
ArrayList<String> list = new ArrayList<>();
list.add("aaa");
list.add("bbb");
list.add("ccc");
list.add("ddd");
ArrayList的数据结构是什么?
Object类型的一维数组
ArrayList默认初始化容量是多少?
10
ArrayList最大容量是多少?
Integer.MAX_VALUE-8
ArrayList最大容量为什么是Integer.MAX_VALUE-8?
减8是为了腾出空间存放数组的头部信息
ArrayList扩容机制是什么?
扩容后的长度是原来长度的1.5倍
如何减少集合的伸缩性及其目的是什么?
根据需求判断元素大概的长度,在创建集合时指定长度,减少扩容次数,提高效率