ArrayList分析

ArrayList分析

• ArrayList是常用的集合实现类。下面展示了一些常见用法。

import java.util.ArrayList;
import java.util.List;
public class ArrayListTest {

    public static void main(String[] args) {
        List<String> list = new ArrayList<>();

        //往容器中添加值
        list.add("aa");
        list.add("bb");
        list.add("cc");

        System.out.println(list.get(0));  // 通过索引获取值
        list.remove(0);  //通过索引移除
        list.remove("bb"); //通过值移除
        list.set(0, "dd");  //修改值

        list.clear(); //清空容器
    }
}

• ArrayList的本质是一个Object数组。构造时可以传入容量，没传默认是一个空数组。

private static final int DEFAULT_CAPACITY = 10;

private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};

transient Object[] elementData; 

private int size;

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);
    }
}


public ArrayList() {
    this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;
}

• 当向容器中添加一个元素时，会检查容器的大小。默认容器大小是10，当放不下时会创建一个容量比当前多一半的数组。然后复制当前的数据。

public boolean add(E e) {
    ensureCapacityInternal(size + 1);  // Increments modCount!!
    elementData[size++] = e;
    return true;
}


private void ensureCapacityInternal(int minCapacity) {
    if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {
        minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
    }

    ensureExplicitCapacity(minCapacity);
}

private void ensureExplicitCapacity(int minCapacity) {
    modCount++;

    // overflow-conscious code
    if (minCapacity - elementData.length > 0)
        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);
}

• 数组复制。可以使用Arrays.copyOf或者System.arraycopy

String[] src = new String[]{"aa","bb","cc"};
String[] dest = Arrays.copyOf(src,6); //[aa, bb, cc, null, null, null]

System.arraycopy(src,0,dest,0,src.length);