1.JDK 1.6
(1)默认的构造函数 初试化时的长度为10:
- public ArrayList() {
- this(10);
- }
带参数的构造函数, 初始化了一个长度为初始容量的数组 :
- public ArrayList(int initialCapacity) {
- super();
- if (initialCapacity < 0)
- throw new IllegalArgumentException("Illegal Capacity: "+
- initialCapacity);
- this.elementData = new Object[initialCapacity];
- }
(2)add方法:
- public boolean add(E e) {
- ensureCapacity(size + 1); // Increments modCount!!
- elementData[size++] = e;
- return true;
- }
- 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);
- }
- }
- int newCapacity = (oldCapacity * 3)/2 + 1
也就是原有容量的1.5倍+1。然后通过底层的复制方法将原有数据复制过来:
- elementData = Arrays.copyOf(elementData, newCapacity);
2.JDK1.7
(1)默认的构造函数 初试化时的长度为10:
- public ArrayList() {
- this(10);
- }
- public ArrayList(int initialCapacity) {
- super();
- if (initialCapacity < 0)
- throw new IllegalArgumentException("Illegal Capacity: "+initialCapacity);
- this.elementData = new Object[initialCapacity];
- }
- public boolean add(E e) {
- ensureCapacityInternal(size + 1); // Increments modCount!!
- elementData[size++] = e;
- return true;
- }
(3)扩容方法:
- private void ensureCapacityInternal(int minCapacity) {
- modCount++;
- // overflow-conscious code
- if (minCapacity - elementData.length > 0)
- grow(minCapacity);
- }
这是JDK1.7 ArrayList扩容的关键方法:
- 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);
- }
此方法里,一旦发现容量不足,会自动扩充容量,新的大小是:
- int newCapacity = oldCapacity + (oldCapacity >> 1);
也就是原有容量加上自己除以2的值。然后通过底层的复制方法将原有数据复制过来:
- elementData = Arrays.copyOf(elementData, newCapacity);
综述所述,JDK1.6和JDK1.7的ArrayList在扩容方面是不同的,JDK1.7通过位移的方式,效率更高些。
原文:https://blog.csdn.net/liuzongxi/article/details/44756687