ArrayList

  
	private static final long serialVersionUID = 8683452581122892189L;
	//不支持序列化
    private transient E[] elementData;
    private int size;
   
	//指定初始容量initialCapacity
    public ArrayList(int initialCapacity) {
	super();
        if (initialCapacity < 0)
            throw new IllegalArgumentException("Illegal Capacity: "+
                                               initialCapacity);
	this.elementData = (E[])new Object[initialCapacity];
    }

    public ArrayList() {
    //初始容量10
	this(10);
    }

    public ArrayList(Collection<? extends E> c) {
        size = c.size();
        // 设置容量1.1倍最大为最大整数
        int capacity = (int) Math.min((size*110L)/100, Integer.MAX_VALUE);
		//复制数组，影响性能
        elementData = (E[]) c.toArray(new Object[capacity]);
    }

    /**
     * 
     */
    public void trimToSize() {
	modCount++;
	//数组长度
	int oldCapacity = elementData.length;
	if (size < oldCapacity) {
	    Object oldData[] = elementData;
		//重设长度为size
	    elementData = (E[])new Object[size];
		//复制数组，对性能有影响
	    System.arraycopy(oldData, 0, elementData, 0, size);
	}
    }

    public void ensureCapacity(int minCapacity) {
    //modCount记录了ArrayList结构性变化的次数
	modCount++;
	//数组现有容量
	int oldCapacity = elementData.length;
	if (minCapacity > oldCapacity) {
	    Object oldData[] = elementData;
		//增长策略1.5+1，如果还小则长度为新长度
	    int newCapacity = (oldCapacity * 3)/2 + 1;
    	    if (newCapacity < minCapacity)
		newCapacity = minCapacity;
	    //创建新数组
	    elementData = (E[])new Object[newCapacity];
		//数组复制
	    System.arraycopy(oldData, 0, elementData, 0, size);
	}
    }

    public int size() {
	//数组元素数量
	return size;
    }

    public boolean isEmpty() {
	return size == 0;
    }

    public boolean contains(Object elem) {
	//是否能索引到
	return indexOf(elem) >= 0;
    }

    public int indexOf(Object elem) {
	//检索null对象
	if (elem == null) {
	    for (int i = 0; i < size; i++)
		if (elementData[i]==null)
		    return i;
	} else {
		//顺序检索
	    for (int i = 0; i < size; i++)
		if (elem.equals(elementData[i]))
		    return i;
	}
	return -1;
    }
    //倒序索引
    public int lastIndexOf(Object elem) {
	if (elem == null) {
	    for (int i = size-1; i >= 0; i--)
		if (elementData[i]==null)
		    return i;
	} else {
	    for (int i = size-1; i >= 0; i--)
		if (elem.equals(elementData[i]))
		    return i;
	}
	return -1;
    }
    //数组复制
    public Object clone() {
	try { 
	    ArrayList<E> v = (ArrayList<E>) super.clone();
	    v.elementData = (E[])new Object[size];
	    System.arraycopy(elementData, 0, v.elementData, 0, size);
	    v.modCount = 0;
	    return v;
	} catch (CloneNotSupportedException e) { 
	    // this shouldn't happen, since we are Cloneable
	    throw new InternalError();
	}
    }
    //返回包含此列表中所有元素的数组
    public Object[] toArray() {
	Object[] result = new Object[size];
	System.arraycopy(elementData, 0, result, 0, size);
	return result;
    }

    public <T> T[] toArray(T[] a) {
        if (a.length < size)
            a = (T[])java.lang.reflect.Array.
		newInstance(a.getClass().getComponentType(), size);
	System.arraycopy(elementData, 0, a, 0, size);
        if (a.length > size)
            a[size] = null;
        return a;
    }

    
    public E get(int index) {
	//检查范围
	RangeCheck(index);

	return elementData[index];
    }

    public E set(int index, E element) {
	//检查范围
	RangeCheck(index);

	E oldValue = elementData[index];
	elementData[index] = element;
	return oldValue;
    }

    /**
     * 新增
     */
    public boolean add(E o) {
    //数组扩容
	ensureCapacity(size + 1);  // Increments modCount!!
	//赋值
	elementData[size++] = o;
	return true;
    }

    public void add(int index, E element) {
	if (index > size || index < 0)
	    throw new IndexOutOfBoundsException(
		"Index: "+index+", Size: "+size);
    //扩容
	ensureCapacity(size+1);  // Increments modCount!!
	//index之后元素后移一位，size增1
	System.arraycopy(elementData, index, elementData, index + 1,
			 size - index);
	elementData[index] = element;
	size++;
    }


    public E remove(int index) {
	RangeCheck(index);

	modCount++;
	E oldValue = elementData[index];

	int numMoved = size - index - 1;
	if (numMoved > 0)
		//前移一位
	    System.arraycopy(elementData, index+1, elementData, index,
			     numMoved);
		//size元素设为null,size-1
	elementData[--size] = null; // Let gc do its work

	return oldValue;
    }

    public boolean remove(Object o) {
	if (o == null) {
            for (int index = 0; index < size; index++)
		if (elementData[index] == null) {
		    fastRemove(index);
		    return true;
		}
	} else {
	    for (int index = 0; index < size; index++)
		if (o.equals(elementData[index])) {
		    fastRemove(index);
		    return true;
		}
        }
	return false;
    }

    private void fastRemove(int index) {
        modCount++;
        int numMoved = size - index - 1;
        if (numMoved > 0)
            System.arraycopy(elementData, index+1, elementData, index, 
                             numMoved);
        elementData[--size] = null; // Let gc do its work
    }

    public void clear() {
	modCount++;

	// Let gc do its work
	for (int i = 0; i < size; i++)
	    elementData[i] = null;

	size = 0;
    }

    public boolean addAll(Collection<? extends E> c) {
	Object[] a = c.toArray();
        int numNew = a.length;
	ensureCapacity(size + numNew);  // Increments modCount
        System.arraycopy(a, 0, elementData, size, numNew);
        size += numNew;
	return numNew != 0;
    }

    public boolean addAll(int index, Collection<? extends E> c) {
	if (index > size || index < 0)
	    throw new IndexOutOfBoundsException(
		"Index: " + index + ", Size: " + size);

	Object[] a = c.toArray();
	int numNew = a.length;
	ensureCapacity(size + numNew);  // Increments modCount

	int numMoved = size - index;
	if (numMoved > 0)
	    System.arraycopy(elementData, index, elementData, index + numNew,
			     numMoved);

        System.arraycopy(a, 0, elementData, index, numNew);
	size += numNew;
	return numNew != 0;
    }

    protected void removeRange(int fromIndex, int toIndex) {
	modCount++;
	int numMoved = size - toIndex;
        System.arraycopy(elementData, toIndex, elementData, fromIndex,
                         numMoved);

	// Let gc do its work
	int newSize = size - (toIndex-fromIndex);
	while (size != newSize)
	    elementData[--size] = null;
    }

    private void RangeCheck(int index) {
	if (index >= size)
	    throw new IndexOutOfBoundsException(
		"Index: "+index+", Size: "+size);
    }
    //重载下面方法,只序列化了数组中有意义的对象，而pos>size的对象无须序列化和反序列化
    private void writeObject(java.io.ObjectOutputStream s)
        throws java.io.IOException{
	int expectedModCount = modCount;
	// Write out element count, and any hidden stuff
	s.defaultWriteObject();

        // Write out array length
        s.writeInt(elementData.length);

	// Write out all elements in the proper order.
	for (int i=0; i<size; i++)
            s.writeObject(elementData[i]);

 	if (modCount != expectedModCount) {
	    throw new ConcurrentModificationException();
	}
    }


    private void readObject(java.io.ObjectInputStream s)
        throws java.io.IOException, ClassNotFoundException {
	// Read in size, and any hidden stuff
	s.defaultReadObject();

        // Read in array length and allocate array
        int arrayLength = s.readInt();
        Object[] a = elementData = (E[])new Object[arrayLength];

	// Read in all elements in the proper order.
	for (int i=0; i<size; i++)
            a[i] = s.readObject();
    }
}