Package rx.internal.util.atomic
Class SpscLinkedAtomicQueue<E>
- java.lang.Object
-
- java.util.AbstractCollection<E>
-
- java.util.AbstractQueue<E>
-
- rx.internal.util.atomic.BaseLinkedAtomicQueue<E>
-
- rx.internal.util.atomic.SpscLinkedAtomicQueue<E>
-
- Type Parameters:
E
-
- All Implemented Interfaces:
java.lang.Iterable<E>
,java.util.Collection<E>
,java.util.Queue<E>
public final class SpscLinkedAtomicQueue<E> extends BaseLinkedAtomicQueue<E>
This is a weakened version of the MPSC algorithm as presented on 1024 Cores by D. Vyukov. The original has been adapted to Java and it's quirks with regards to memory model and layout:- As this is an SPSC we have no need for XCHG, an ordered store is enough.
-
-
Constructor Summary
Constructors Constructor Description SpscLinkedAtomicQueue()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
offer(E nextValue)
IMPLEMENTATION NOTES:
Offer is allowed from a SINGLE thread.
Offer allocates a new node (holding the offered value) and: Sets that node as the producerNode.next Sets the new node as the producerNode From this follows that producerNode.next is always null and for all other nodes node.next is not null.E
peek()
E
poll()
IMPLEMENTATION NOTES:
Poll is allowed from a SINGLE thread.
Poll reads the next node from the consumerNode and: If it is null, the queue is empty.-
Methods inherited from class rx.internal.util.atomic.BaseLinkedAtomicQueue
isEmpty, iterator, lpConsumerNode, lpProducerNode, lvConsumerNode, lvProducerNode, size, spConsumerNode, spProducerNode, xchgProducerNode
-
Methods inherited from class java.util.AbstractCollection
contains, containsAll, remove, removeAll, retainAll, toArray, toArray, toString
-
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
-
-
-
-
Method Detail
-
offer
public boolean offer(E nextValue)
IMPLEMENTATION NOTES:
Offer is allowed from a SINGLE thread.
Offer allocates a new node (holding the offered value) and:- Sets that node as the producerNode.next
- Sets the new node as the producerNode
- See Also:
Queue.offer(java.lang.Object)
-
poll
public E poll()
IMPLEMENTATION NOTES:
Poll is allowed from a SINGLE thread.
Poll reads the next node from the consumerNode and:- If it is null, the queue is empty.
- If it is not null set it as the consumer node and return it's now evacuated value.
-
peek
public E peek()
-
-