zjuwzp的博客

LinkedBlockingQueue的构造LinkedBlockingQueue<String> linkedBlockingQueue = new LinkedBlockingQueue<String>(20);构造函数public LinkedBlockingQueue(int capacity) { if (capacity <= 0) thr...

offer的多线程并发安全if (p.casNext(null, newNode)) {上面这行代码通过CAS操作入队，同一时间只有一个线程可以成功。其他线程入队失败，然后死循环，不断尝试让指针往后挪动到最后一个尾部节点，再次尝试用CAS将自己入队，加入队尾。...

1、remove方法public boolean remove(Object o) { if (o != null) { Node<E> next, pred = null; for (Node<E> p = first(); p != null; pred = p, p = next) { boole...

1、peek函数public E peek() { restartFromHead: for (;;) { for (Node<E> h = head, p = h, q;;) { E item = p.item; if (item != null || (q = p.next) == null) { ...

出队函数public E poll() { restartFromHead: for (;;) { for (Node<E> h = head, p = h, q;;) { E item = p.item; if (item != null && p.casItem(item, null...

1、构造函数public ConcurrentLinkedQueue() { head = tail = new Node<E>(null);}点击new Node(null)进入如下代码Node(E item) { UNSAFE.putObject(this, itemOffset, item);}这里的itemOffset是item这个属性相对于No...

空参构造函数public CopyOnWriteArrayList() { setArray(new Object[0]);}构造一个空数组，调用setArray将其赋值给成员变量array。final void setArray(Object[] a) { array = a;}成员变量array用volatile修饰。private transient vol...