/**
	 * 检查数组容量是否够用
	 * @param minCapacity
	 */
	public void ensureCapacity(int minCapacity){
		modCount++;
		int oldCapacity = elementData.length;
		if(minCapacity > oldCapacity){
			Object oldData[] = elementData;
			int newCapacity = (oldCapacity * 3)/2+1;
			if(newCapacity 

/* (non-Javadoc)
	 * 向ArrayList中添加元素
	 * @see java.util.AbstractList#add(java.lang.Object)
	 */
	public boolean add(E e){
		ensureCapacity(size+1);
		elementData[size++] = e;
		return true;
	}

/**
     * 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 

/* 
	 * 添加元素集合
	 * (non-Javadoc)
	 * @see java.util.AbstractCollection#addAll(java.util.Collection)
	 */
	public boolean addAll(Collection extends E> c){
		Object[] a = c.toArray();
		int numNew = a.length;
		ensureCapacity(size+numNew);
		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)
	    System.arraycopy(elementData, index, elementData, index + numNew,
			     numMoved);

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