CopyOnWriteArrayList与CopyOnWriteArraySet源码简析_copyonwritearrayset原子性-优快云博客

本文详细介绍了CopyOnWriteArrayList的数据结构、线程安全机制及核心方法如add、set和remove的实现原理。同时，还探讨了CopyOnWriteArraySet如何基于CopyOnWriteArrayList实现无重复元素的特性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

转载自：
http://www.cnblogs.com/leesf456/p/5547853.html
http://www.cnblogs.com/leesf456/p/5549138.html

CopyOnWriteArrayList

　　CopyOnWriteArrayList使用的数据结构是数组:

public class CopyOnWriteArrayList<E>
    implements List<E>, RandomAccess, Cloneable, java.io.Serializable {

    /** The lock protecting all mutators */
    final transient ReentrantLock lock = new ReentrantLock();

    /** The array, accessed only via getArray/setArray. */
    private transient volatile Object[] array;

    private static final sun.misc.Unsafe UNSAFE;
    private static final long lockOffset;
    static {
        try {
            UNSAFE = sun.misc.Unsafe.getUnsafe();
            Class<?> k = CopyOnWriteArrayList.class;
            lockOffset = UNSAFE.objectFieldOffset
                (k.getDeclaredField("lock"));
        } catch (Exception e) {
            throw new Error(e);
        }
    }

　　CopyOnWriteArrayList中有一个可重入锁，用来保证线程安全访问，还有一个Object类型的数组，用来存放具体的元素。当然，也使用到了反射机制和CAS来保证原子性的修改lock域。

add方法：

    public boolean add(E e) {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            Object[] elements = getArray();
            int len = elements.length;
            Object[] newElements = Arrays.copyOf(elements, len + 1);
            newElements[len] = e;
            setArray(newElements);
            return true;
        } finally {
            lock.unlock();
        }
    }

　　此函数用于将指定元素添加到此列表的尾部，先获取锁（保证多线程的安全访问），获取当前的Object数组，获取Object数组的长度为length，根据Object数组复制一个长度为length+1的Object数组为newElements（此时，newElements[length]为null），再将下标为length的数组元素newElements[length]设置为元素e，再设置当前Object[]为newElements，释放锁，这样就完成了元素的添加。
　　可以关注下Arrays.copyOf()源码：

    public static <T> T[] copyOf(T[] original, int newLength) {
        return (T[]) copyOf(original, newLength, original.getClass());
    }
    public static <T,U> T[] copyOf(U[] original, int newLength, Class<? extends T[]> newType) {
        @SuppressWarnings("unchecked")
        T[] copy = ((Object)newType == (Object)Object[].class)
            ? (T[]) new Object[newLength]
            : (T[]) Array.newInstance(newType.getComponentType(), newLength);
        System.arraycopy(original, 0, copy, 0,
                         Math.min(original.length, newLength));
        return copy;
    }

set方法：

    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;
                Object[] newElements = Arrays.copyOf(elements, len);
                newElements[index] = element;
                setArray(newElements);
            } else {
                // Not quite a no-op; ensures volatile write semantics
                setArray(elements);
            }
            return oldValue;
        } finally {
            lock.unlock();
        }
    }

　　此函数用于用指定的元素替代此列表指定位置上的元素，也是基于数组的复制来实现的。关于注释中”Not quite a no-op; ensures volatile write semantics”，可以移步：http://blog.youkuaiyun.com/zero__007/article/details/67644095。

remove方法：

    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)
                setArray(Arrays.copyOf(elements, len - 1));
            else {
                Object[] newElements = new Object[len - 1];
                System.arraycopy(elements, 0, newElements, 0, index);
                System.arraycopy(elements, index + 1, newElements, index,
                                 numMoved);
                setArray(newElements);
            }
            return oldValue;
        } finally {
            lock.unlock();
        }
    }

　　此函数用于移除此列表指定位置上的元素。注意这里的处理方式，会先复制index索引前的元素，再复制index索引后的元素，然后设置数组。

CopyOnWriteArraySet

　　CopyOnWriteArraySet的底层是由CopyOnWriteArrayList提供支持，并且将对其的操作转发至对CopyOnWriteArrayList的操作。但是，CopyOnWriteArraySet的元素不允许重复，这是和CopyOnWriteArrayList不相同的地方。

public class CopyOnWriteArraySet<E> extends AbstractSet<E>
        implements java.io.Serializable {
    private static final long serialVersionUID = 5457747651344034263L;

    private final CopyOnWriteArrayList<E> al;

add方法：

    public boolean add(E e) {
        return al.addIfAbsent(e);
    }

    public boolean addIfAbsent(E e) {
        Object[] snapshot = getArray();
        return indexOf(e, snapshot, 0, snapshot.length) >= 0 ? false :
            addIfAbsent(e, snapshot);
    }

    private boolean addIfAbsent(E e, Object[] snapshot) {
        final ReentrantLock lock = this.lock;
        lock.lock();
        try {
            Object[] current = getArray();
            int len = current.length;
            if (snapshot != current) {
                // Optimize for lost race to another addXXX operation
                int common = Math.min(snapshot.length, len);
                for (int i = 0; i < common; i++)
                    if (current[i] != snapshot[i] && eq(e, current[i]))
                        return false;
                if (indexOf(e, current, common, len) >= 0)
                        return false;
            }
            Object[] newElements = Arrays.copyOf(current, len + 1);
            newElements[len] = e;
            setArray(newElements);
            return true;
        } finally {
            lock.unlock();
        }
    }