Update MpscLinkedQueue队列原理分析.md
This commit is contained in:
parent
81619155d5
commit
4cecd88a07
@ -14,7 +14,7 @@
|
||||
|
||||
而后,来看 MpscLinkedQueue 的构造方法。
|
||||
|
||||
```Java
|
||||
```java
|
||||
MpscLinkedQueue() {
|
||||
MpscLinkedQueueNode<E> tombstone = new DefaultNode<E>(null);
|
||||
headRef = new FullyPaddedReference<MpscLinkedQueueNode<E>>();
|
||||
@ -27,7 +27,7 @@
|
||||
|
||||
### MpscLinkedQueue 如何做到线程安全的无锁加入
|
||||
|
||||
```Java
|
||||
```java
|
||||
@Override
|
||||
@SuppressWarnings("unchecked")
|
||||
public boolean offer(E value) {
|
||||
|
Loading…
x
Reference in New Issue
Block a user