E - abstract class BaseLinkedAtomicQueue<E> extends BaseLinkedAtomicQueuePad2<E>
MessagePassingQueue.Consumer<T>, MessagePassingQueue.ExitCondition, MessagePassingQueue.Supplier<T>, MessagePassingQueue.WaitStrategyp01, p02, p03, p04, p05, p06, p07, p10, p11, p12, p13, p14, p15, p16, p17consumerNodeproducerNodep00UNBOUNDED_CAPACITY| Constructor and Description |
|---|
BaseLinkedAtomicQueue() |
| Modifier and Type | Method and Description |
|---|---|
int |
capacity() |
int |
drain(MessagePassingQueue.Consumer<E> c)
Remove all available item from the queue and hand to consume.
|
int |
drain(MessagePassingQueue.Consumer<E> c,
int limit)
Remove up to limit elements from the queue and hand to consume.
|
void |
drain(MessagePassingQueue.Consumer<E> c,
MessagePassingQueue.WaitStrategy wait,
MessagePassingQueue.ExitCondition exit)
Remove elements from the queue and hand to consume forever.
|
protected E |
getSingleConsumerNodeValue(LinkedQueueAtomicNode<E> currConsumerNode,
LinkedQueueAtomicNode<E> nextNode) |
boolean |
isEmpty()
This method's accuracy is subject to concurrent modifications happening as the observation is carried
out.
|
java.util.Iterator<E> |
iterator() |
protected LinkedQueueAtomicNode<E> |
newNode() |
protected LinkedQueueAtomicNode<E> |
newNode(E e) |
boolean |
relaxedOffer(E e)
Called from a producer thread subject to the restrictions appropriate to the implementation.
|
E |
relaxedPeek()
Called from the consumer thread subject to the restrictions appropriate to the implementation.
|
E |
relaxedPoll()
Called from the consumer thread subject to the restrictions appropriate to the implementation.
|
int |
size()
This method's accuracy is subject to concurrent modifications happening as the size is estimated and as
such is a best effort rather than absolute value.
|
java.lang.String |
toString() |
lpConsumerNode, lvConsumerNode, spConsumerNodecasProducerNode, lpProducerNode, lvProducerNode, spProducerNode, xchgProducerNodecontains, containsAll, remove, removeAll, retainAll, toArray, toArrayclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitclear, fill, fill, fill, offer, peek, pollpublic final java.util.Iterator<E> iterator()
public java.lang.String toString()
toString in class java.util.AbstractCollection<E>protected final LinkedQueueAtomicNode<E> newNode()
protected final LinkedQueueAtomicNode<E> newNode(E e)
public final int size()
IMPLEMENTATION NOTES:
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. In
particular when racing with the consumer thread this method may under estimate the size.
size in interface java.util.Collection<E>size in interface MessagePassingQueue<E>size in class java.util.AbstractCollection<E>Integer.MAX_VALUE but less or equals to
capacity (if bounded).Collection.size()public final boolean isEmpty()
IMPLEMENTATION NOTES:
Queue is empty when producerNode is the same as consumerNode. An alternative implementation would be to
observe the producerNode.value is null, which also means an empty queue because only the
consumerNode.value is allowed to be null.
isEmpty in interface java.util.Collection<E>isEmpty in interface MessagePassingQueue<E>isEmpty in class java.util.AbstractCollection<E>MessagePassingQueue.isEmpty()protected E getSingleConsumerNodeValue(LinkedQueueAtomicNode<E> currConsumerNode, LinkedQueueAtomicNode<E> nextNode)
public E relaxedPoll()
MessagePassingQueueQueue.poll() this method may return null without the queue being empty.public E relaxedPeek()
MessagePassingQueueQueue.peek() this method may return null without the queue being empty.public boolean relaxedOffer(E e)
MessagePassingQueueQueue.offer(Object) this method may return false without the queue being full.e - not null, will throw NPE if it ispublic int drain(MessagePassingQueue.Consumer<E> c)
MessagePassingQueue
M m;
while((m = relaxedPoll()) != null){
c.accept(m);
}
There's no strong commitment to the queue being empty at the end of a drain. Called from a
consumer thread subject to the restrictions appropriate to the implementation.public int drain(MessagePassingQueue.Consumer<E> c, int limit)
MessagePassingQueue
M m;
int i = 0;
for(;i < limit && (m = relaxedPoll()) != null; i++){
c.accept(m);
}
return i;
There's no strong commitment to the queue being empty at the end of a drain. Called from a consumer thread subject to the restrictions appropriate to the implementation.
public void drain(MessagePassingQueue.Consumer<E> c, MessagePassingQueue.WaitStrategy wait, MessagePassingQueue.ExitCondition exit)
MessagePassingQueue
int idleCounter = 0;
while (exit.keepRunning()) {
E e = relaxedPoll();
if(e==null){
idleCounter = wait.idle(idleCounter);
continue;
}
idleCounter = 0;
c.accept(e);
}
Called from a consumer thread subject to the restrictions appropriate to the implementation.
public int capacity()
MessagePassingQueue.UNBOUNDED_CAPACITY if not bounded