public class copyOnwriteArrayList<E>
implements List<E>,RandomAccess，Cloneable，java.io.Serializable {
//加鎖: ReentrantLock
final transient ReentrantLock lock = new ReentrantLock( ) ;
// volatile:保證可見性
private transient volatile object[ ] array;
//獲取數(shù)組
final object[] getArray() ireturn array ;
}
//存入數(shù)組
final void setArray(object[ ] a) iarray = a;
}
//無參構(gòu)造方法:初始化數(shù)組，容量為日public CopyOnwriteArrayList( ) i
setArray( new object[e]);
}
//有參構(gòu)造方法:傳入集合
public CopyOnwriteArrayList(collection< ? extends E> c) {
object[] elements;
//判斷傳入的集合是否是CopyOnwriteArrayList類型if (c.getclass() == copyonwriteArrayList.class)
//獲取數(shù)組
elements = ((copyOnwriteArrayList<?>)c).getArray();else i
//將集合轉(zhuǎn)為數(shù)組
elements = c.toArray();
// c.toArray might (incorrectly) not return object[] (see 6260652)1/判斷數(shù)組是否是object[]
if (elements.getclass() i= object[].class)
//復(fù)制數(shù)組
elements = Arrays.copyof(elements，elements.length，object[ ].c1
}
setArray(elements) ;
}
setArray(elements ) ;
}

public boolean add(E e) {
	final ReentrantLock lock = this.lock;
	lock.lock();
	try {
		Object[] elements = getArray();
		int len = elements.length;
		// 拷貝一個(gè)長度+1的數(shù)組，將元素放到末尾
		Object[] newElements = Arrays.copyOf(elements, len + 1);
        // 填充要追加的元素e
		newElements[len] = e;
        // 覆蓋舊數(shù)組
		setArray(newElements);
		return true;
	} finally {
		lock.unlock();
	}
}

public E set(int index, E element) {
	final ReentrantLock lock = this.lock;
	lock.lock();
	try {
		Object[] elements = getArray();
		// 先獲取舊元素
		E oldValue = get(elements, index);
		if (oldValue != element) {
			int len = elements.length;
			// 拷貝一個(gè)一樣的數(shù)組，替換下標(biāo)元素，并寫入array
			Object[] newElements = Arrays.copyOf(elements, len);
			newElements[index] = element;
			setArray(newElements);
		} else {
			// 即使元素沒有變化，也要寫入array，確保volatile的寫語義
			// Not quite a no-op; ensures volatile write semantics
			setArray(elements);
		}
		return oldValue;
	} finally {
		lock.unlock();
	}
}

public E remove(int index) {
	final ReentrantLock lock = this.lock;
	lock.lock();
	try {
		Object[] elements = getArray();
		int len = elements.length;
		// 要移除的舊元素
		E oldValue = get(elements, index);
		int numMoved = len - index - 1;
		if (numMoved == 0)
			// 刪除的是最后一個(gè)元素，直接拷貝一個(gè)長度-1的數(shù)組寫回array即可
			setArray(Arrays.copyOf(elements, len - 1));
		else {
			// 刪除的是中間元素，拷貝一個(gè)長度-1的數(shù)組
			Object[] newElements = new Object[len - 1];
			// 拷貝前半段元素
			System.arraycopy(elements, 0, newElements, 0, index);
			// 拷貝后半段元素
			System.arraycopy(elements, index + 1, newElements, index,
					numMoved);
			// 寫回array
			setArray(newElements);
		}
		return oldValue;
	} finally {
		lock.unlock();
	}
}

public E get(int index) {
    // getArray()獲取的就是array
    return get(getArray(), index);
}
private E get(Object[] a, int index) {
    return (E) a[index];
}

public int size() {
    return getArray().length;
}