public class MpscIntrusiveLinkedQueue extends MpscIntrusiveLinkedQueueConsumerNodeRef
Modifier and Type | Field and Description |
---|---|
(package private) long |
p01 |
(package private) long |
p02 |
(package private) long |
p03 |
(package private) long |
p04 |
(package private) long |
p05 |
(package private) long |
p06 |
(package private) long |
p07 |
(package private) long |
p10 |
(package private) long |
p11 |
(package private) long |
p12 |
(package private) long |
p13 |
(package private) long |
p14 |
(package private) long |
p15 |
(package private) long |
p16 |
(package private) long |
p17 |
stub
p00
Constructor and Description |
---|
MpscIntrusiveLinkedQueue() |
Modifier and Type | Method and Description |
---|---|
void |
clear() |
boolean |
isEmpty() |
boolean |
offer(Node node) |
Node |
peek() |
Node |
poll() |
int |
size()
This is an O(n) operation as we run through all the nodes and count them.
The accuracy of the value returned by this method is subject to races with producer/consumer threads. |
lpConsumerNode, lvConsumerNode, spConsumerNode
lvProducerNode, xchgProducerNode
long p01
long p02
long p03
long p04
long p05
long p06
long p07
long p10
long p11
long p12
long p13
long p14
long p15
long p16
long p17
public boolean offer(Node node)
public Node poll()
public Node peek()
public void clear()
public int size()
public boolean isEmpty()