简要说明
ArrayList内部实际上使用了一个Object数组来存储数据,并非真实的泛型,通过无参构造方法创建的ArrayList,其默认的初始化大小为10。ArrayList扩容的本质是创建新数组,然后复制元素来实现的。插入元素可能会导致移动插入位置之后的所有元素,每次插入元素,都需要检查数组大小,以决定是否需要扩容。获取元素是从Object数组中取出元素,然后强制转换成的类型。
1. 内部存储
ArrayList内部实际上使用了一个Object数组来存储数据,并非真实的泛型:
/**
* The array buffer into which the elements of the ArrayList are stored.
* The capacity of the ArrayList is the length of this array buffer.
*/
private transient Object[] elementData;
/**
* The size of the ArrayList (the number of elements it contains).
*
* @serial
*/
private int size;
2.构造方法
ArrayList有三个构造方法:
(1)接受一个初始容量值的构造方法:
/**
* Constructs an empty list with the specified initial capacity.
*
* @param initialCapacity the initial capacity of the list
* @exception IllegalArgumentException if the specified initial capacity is negative
*/
public ArrayList(int initialCapacity) {
super();
if (initialCapacity < 0)
throw new IllegalArgumentException("Illegal Capacity: "+initialCapacity);
this.elementData = new Object[initialCapacity];
}
(2) 无参构造方法,无参构造方法,会初始化一给大小为10的Object数组
/**
* Constructs an empty list with an initial capacity of ten.
*/
public ArrayList() {
this(10);
}
(3) 接受一个集合参数的构造方法:
/**
* Constructs a list containing the elements of the specified
* collection, in the order they are returned by the collection's
* iterator.
*
* @param c the collection whose elements are to be placed into this list
* @throws NullPointerException if the specified collection is null
*/
public ArrayList(Collection<? extends E> c) {
elementData = c.toArray();
size = elementData.length;
// c.toArray might (incorrectly) not return Object[] (see 6260652)
if (elementData.getClass() != Object[].class)
elementData = Arrays.copyOf(elementData, size, Object[].class);
}
3.添加元素到尾部
向ArrayList中添加元素的最简单方法是add(Object),这个方法做了两件事:
- 检查数组长度,如果数组总长度length < size + 1(size是当前列表中元素个数),则需要对数组扩容。扩容的方法就是重新分配一个新数组,然后复制元素到新数组中。
- 将元素添加到数组末位
代码如下:
/**
* Appends the specified element to the end of this list.
*
* @param e element to be appended to this list
* @return <tt>true</tt> (as specified by {@link Collection#add})
*/
public boolean add(E e) {
ensureCapacity(size + 1); // Increments modCount!!
elementData[size++] = e;
return true;
}
其中,ensureCapacity方法就是检查数组容量是否足够的,如果不够则扩容,扩容算法为:int newCapacity = (oldCapacity * 3)/2 + 1;
* Increases the capacity of this <tt>ArrayList</tt> instance, if
* necessary, to ensure that it can hold at least the number of elements
* specified by the minimum capacity argument.
*
* @param minCapacity the desired minimum capacity
*/
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);
}
}
4. 插入元素到指定位置
插入元素会导致元素移动,操作步骤:先检查是否需要扩容,然后计算是否需要移动元素,如有则先移动元素,最后把新元素插入到指定位置。
/**
* Inserts the specified element at the specified position in this
* list. Shifts the element currently at that position (if any) and
* any subsequent elements to the right (adds one to their indices).
*
* @param index index at which the specified element is to be inserted
* @param element element to be inserted
* @throws IndexOutOfBoundsException {@inheritDoc}
*/
public void add(int index, E element) {
if (index > size || index < 0)
throw new IndexOutOfBoundsException(
"Index: "+index+", Size: "+size);
ensureCapacity(size+1); // Increments modCount!!
System.arraycopy(elementData, index, elementData, index + 1,
size - index);
elementData[index] = element;
size++;
}
5. 获取元素
从Object数组中取到元素,然后强制转换成中的类型
/**
* Returns the element at the specified position in this list.
*
* @param index index of the element to return
* @return the element at the specified position in this list
* @throws IndexOutOfBoundsException {@inheritDoc}
*/
public E get(int index) {
RangeCheck(index);
return (E) elementData[index];
}