public class MpscBlockingConsumerArrayQueue<E> extends MpscBlockingConsumerArrayQueueConsumerFields<E> implements MessagePassingQueue<E>, QueueProgressIndicators, java.util.concurrent.BlockingQueue<E>
BlockingQueue on the consumer side only on top
of the mechanics described in BaseMpscLinkedArrayQueue, but with the reservation bit used for blocking rather
than resizing in this instance.MessagePassingQueue.Consumer<T>, MessagePassingQueue.ExitCondition, MessagePassingQueue.Supplier<T>, MessagePassingQueue.WaitStrategy| Modifier and Type | Field and Description |
|---|---|
(package private) byte |
b000 |
(package private) byte |
b001 |
(package private) byte |
b002 |
(package private) byte |
b003 |
(package private) byte |
b004 |
(package private) byte |
b005 |
(package private) byte |
b006 |
(package private) byte |
b007 |
(package private) byte |
b010 |
(package private) byte |
b011 |
(package private) byte |
b012 |
(package private) byte |
b013 |
(package private) byte |
b014 |
(package private) byte |
b015 |
(package private) byte |
b016 |
(package private) byte |
b017 |
(package private) byte |
b020 |
(package private) byte |
b021 |
(package private) byte |
b022 |
(package private) byte |
b023 |
(package private) byte |
b024 |
(package private) byte |
b025 |
(package private) byte |
b026 |
(package private) byte |
b027 |
(package private) byte |
b030 |
(package private) byte |
b031 |
(package private) byte |
b032 |
(package private) byte |
b033 |
(package private) byte |
b034 |
(package private) byte |
b035 |
(package private) byte |
b036 |
(package private) byte |
b037 |
(package private) byte |
b040 |
(package private) byte |
b041 |
(package private) byte |
b042 |
(package private) byte |
b043 |
(package private) byte |
b044 |
(package private) byte |
b045 |
(package private) byte |
b046 |
(package private) byte |
b047 |
(package private) byte |
b050 |
(package private) byte |
b051 |
(package private) byte |
b052 |
(package private) byte |
b053 |
(package private) byte |
b054 |
(package private) byte |
b055 |
(package private) byte |
b056 |
(package private) byte |
b057 |
(package private) byte |
b060 |
(package private) byte |
b061 |
(package private) byte |
b062 |
(package private) byte |
b063 |
(package private) byte |
b064 |
(package private) byte |
b065 |
(package private) byte |
b066 |
(package private) byte |
b067 |
(package private) byte |
b070 |
(package private) byte |
b071 |
(package private) byte |
b072 |
(package private) byte |
b073 |
(package private) byte |
b074 |
(package private) byte |
b075 |
(package private) byte |
b076 |
(package private) byte |
b077 |
(package private) byte |
b100 |
(package private) byte |
b101 |
(package private) byte |
b102 |
(package private) byte |
b103 |
(package private) byte |
b104 |
(package private) byte |
b105 |
(package private) byte |
b106 |
(package private) byte |
b107 |
(package private) byte |
b110 |
(package private) byte |
b111 |
(package private) byte |
b112 |
(package private) byte |
b113 |
(package private) byte |
b114 |
(package private) byte |
b115 |
(package private) byte |
b116 |
(package private) byte |
b117 |
(package private) byte |
b120 |
(package private) byte |
b121 |
(package private) byte |
b122 |
(package private) byte |
b123 |
(package private) byte |
b124 |
(package private) byte |
b125 |
(package private) byte |
b126 |
(package private) byte |
b127 |
(package private) byte |
b130 |
(package private) byte |
b131 |
(package private) byte |
b132 |
(package private) byte |
b133 |
(package private) byte |
b134 |
(package private) byte |
b135 |
(package private) byte |
b136 |
(package private) byte |
b137 |
(package private) byte |
b140 |
(package private) byte |
b141 |
(package private) byte |
b142 |
(package private) byte |
b143 |
(package private) byte |
b144 |
(package private) byte |
b145 |
(package private) byte |
b146 |
(package private) byte |
b147 |
(package private) byte |
b150 |
(package private) byte |
b151 |
(package private) byte |
b152 |
(package private) byte |
b153 |
(package private) byte |
b154 |
(package private) byte |
b155 |
(package private) byte |
b156 |
(package private) byte |
b157 |
(package private) byte |
b160 |
(package private) byte |
b161 |
(package private) byte |
b162 |
(package private) byte |
b163 |
(package private) byte |
b164 |
(package private) byte |
b165 |
(package private) byte |
b166 |
(package private) byte |
b167 |
(package private) byte |
b170 |
(package private) byte |
b171 |
(package private) byte |
b172 |
(package private) byte |
b173 |
(package private) byte |
b174 |
(package private) byte |
b175 |
(package private) byte |
b176 |
(package private) byte |
b177 |
consumerBuffer, consumerMaskproducerBuffer, producerMaskUNBOUNDED_CAPACITY| Constructor and Description |
|---|
MpscBlockingConsumerArrayQueue(int capacity) |
| Modifier and Type | Method and Description |
|---|---|
int |
capacity() |
long |
currentConsumerIndex()
This method has no concurrent visibility semantics.
|
long |
currentProducerIndex()
This method has no concurrent visibility semantics.
|
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.
|
int |
drain(MessagePassingQueue.Consumer<E> c,
int limit,
long timeout,
java.util.concurrent.TimeUnit unit)
Remove up to limit elements from the queue and hand to consume, waiting up to the specified wait time if
necessary for an element to become available.
|
void |
drain(MessagePassingQueue.Consumer<E> c,
MessagePassingQueue.WaitStrategy w,
MessagePassingQueue.ExitCondition exit)
Remove elements from the queue and hand to consume forever.
|
int |
drainTo(java.util.Collection<? super E> c) |
int |
drainTo(java.util.Collection<? super E> c,
int maxElements) |
int |
fill(MessagePassingQueue.Supplier<E> s)
Stuff the queue with elements from the supplier.
|
int |
fill(MessagePassingQueue.Supplier<E> s,
int limit)
Stuff the queue with up to limit elements from the supplier.
|
void |
fill(MessagePassingQueue.Supplier<E> s,
MessagePassingQueue.WaitStrategy wait,
MessagePassingQueue.ExitCondition exit)
Stuff the queue with elements from the supplier forever.
|
boolean |
isEmpty()
This method's accuracy is subject to concurrent modifications happening as the observation is carried
out.
|
java.util.Iterator<E> |
iterator() |
boolean |
offer(E e)
Called from a producer thread subject to the restrictions appropriate to the implementation and
according to the
Queue.offer(Object) interface. |
boolean |
offer(E e,
long timeout,
java.util.concurrent.TimeUnit unit) |
private boolean |
offerAndWakeup(E[] buffer,
long mask,
long pIndex,
E e) |
boolean |
offerIfBelowThreshold(E e,
int threshold)
|
private E |
parkUntilNext(E[] buffer,
long cIndex,
long offset,
long timeoutNs) |
E |
peek()
Called from the consumer thread subject to the restrictions appropriate to the implementation and
according to the
Queue.peek() interface. |
E |
poll()
Called from the consumer thread subject to the restrictions appropriate to the implementation and
according to the
Queue.poll() interface. |
E |
poll(long timeout,
java.util.concurrent.TimeUnit unit) |
void |
put(E e) |
private boolean |
recalculateProducerLimit(long mask,
long pIndex,
long producerLimit) |
private boolean |
recalculateProducerLimit(long pIndex,
long producerLimit,
long cIndex,
long bufferCapacity,
long threshold) |
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 |
remainingCapacity() |
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.
|
private static <E> E |
spinWaitForElement(E[] buffer,
long offset) |
E |
take() |
java.lang.String |
toString() |
lpConsumerIndex, lvBlocked, lvConsumerIndex, soBlocked, soConsumerIndexcasProducerIndex, lvProducerIndex, soProducerIndexcasProducerLimit, lvProducerLimit, soProducerLimitcontains, containsAll, remove, removeAll, retainAll, toArray, toArrayclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitclearbyte b000
byte b001
byte b002
byte b003
byte b004
byte b005
byte b006
byte b007
byte b010
byte b011
byte b012
byte b013
byte b014
byte b015
byte b016
byte b017
byte b020
byte b021
byte b022
byte b023
byte b024
byte b025
byte b026
byte b027
byte b030
byte b031
byte b032
byte b033
byte b034
byte b035
byte b036
byte b037
byte b040
byte b041
byte b042
byte b043
byte b044
byte b045
byte b046
byte b047
byte b050
byte b051
byte b052
byte b053
byte b054
byte b055
byte b056
byte b057
byte b060
byte b061
byte b062
byte b063
byte b064
byte b065
byte b066
byte b067
byte b070
byte b071
byte b072
byte b073
byte b074
byte b075
byte b076
byte b077
byte b100
byte b101
byte b102
byte b103
byte b104
byte b105
byte b106
byte b107
byte b110
byte b111
byte b112
byte b113
byte b114
byte b115
byte b116
byte b117
byte b120
byte b121
byte b122
byte b123
byte b124
byte b125
byte b126
byte b127
byte b130
byte b131
byte b132
byte b133
byte b134
byte b135
byte b136
byte b137
byte b140
byte b141
byte b142
byte b143
byte b144
byte b145
byte b146
byte b147
byte b150
byte b151
byte b152
byte b153
byte b154
byte b155
byte b156
byte b157
byte b160
byte b161
byte b162
byte b163
byte b164
byte b165
byte b166
byte b167
byte b170
byte b171
byte b172
byte b173
byte b174
byte b175
byte b176
byte b177
public MpscBlockingConsumerArrayQueue(int capacity)
public final java.util.Iterator<E> iterator()
public final int size()
MessagePassingQueuesize 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).public final boolean isEmpty()
MessagePassingQueueisEmpty in interface java.util.Collection<E>isEmpty in interface MessagePassingQueue<E>isEmpty in class java.util.AbstractCollection<E>public java.lang.String toString()
toString in class java.util.AbstractCollection<E>public boolean offerIfBelowThreshold(E e, int threshold)
e - the object to offer onto the queue, not nullthreshold - the maximum allowable sizepublic boolean offer(E e)
MessagePassingQueueQueue.offer(Object) interface.offer in interface java.util.concurrent.BlockingQueue<E>offer in interface java.util.Queue<E>offer in interface MessagePassingQueue<E>e - not null, will throw NPE if it ispublic void put(E e) throws java.lang.InterruptedException
put in interface java.util.concurrent.BlockingQueue<E>java.lang.InterruptedExceptionpublic boolean offer(E e, long timeout, java.util.concurrent.TimeUnit unit) throws java.lang.InterruptedException
offer in interface java.util.concurrent.BlockingQueue<E>java.lang.InterruptedExceptionprivate boolean recalculateProducerLimit(long mask,
long pIndex,
long producerLimit)
private boolean recalculateProducerLimit(long pIndex,
long producerLimit,
long cIndex,
long bufferCapacity,
long threshold)
public E take() throws java.lang.InterruptedException
This implementation is correct for single consumer thread use only.
take in interface java.util.concurrent.BlockingQueue<E>java.lang.InterruptedExceptionpublic E poll(long timeout, java.util.concurrent.TimeUnit unit) throws java.lang.InterruptedException
This implementation is correct for single consumer thread use only.
poll in interface java.util.concurrent.BlockingQueue<E>java.lang.InterruptedExceptionprivate E parkUntilNext(E[] buffer, long cIndex, long offset, long timeoutNs) throws java.lang.InterruptedException
java.lang.InterruptedExceptionpublic int remainingCapacity()
remainingCapacity in interface java.util.concurrent.BlockingQueue<E>public int drainTo(java.util.Collection<? super E> c)
drainTo in interface java.util.concurrent.BlockingQueue<E>public int drainTo(java.util.Collection<? super E> c, int maxElements)
drainTo in interface java.util.concurrent.BlockingQueue<E>public E poll()
Queue.poll() interface.
This implementation is correct for single consumer thread use only.
poll in interface java.util.Queue<E>poll in interface MessagePassingQueue<E>null iff emptyprivate static <E> E spinWaitForElement(E[] buffer,
long offset)
public E peek()
Queue.peek() interface.
This implementation is correct for single consumer thread use only.
peek in interface java.util.Queue<E>peek in interface MessagePassingQueue<E>null iff emptypublic long currentProducerIndex()
QueueProgressIndicatorscurrentProducerIndex in interface QueueProgressIndicatorspublic long currentConsumerIndex()
QueueProgressIndicatorscurrentConsumerIndex in interface QueueProgressIndicatorspublic int capacity()
capacity in interface IndexedQueueSizeUtil.IndexedQueuecapacity in interface MessagePassingQueue<E>MessagePassingQueue.UNBOUNDED_CAPACITY if not boundedpublic boolean relaxedOffer(E e)
MessagePassingQueueQueue.offer(Object) this method may return false without the queue being full.relaxedOffer in interface MessagePassingQueue<E>e - not null, will throw NPE if it ispublic E relaxedPoll()
MessagePassingQueueQueue.poll() this method may return null without the queue being empty.relaxedPoll in interface MessagePassingQueue<E>null if unable to pollpublic E relaxedPeek()
MessagePassingQueueQueue.peek() this method may return null without the queue being empty.relaxedPeek in interface MessagePassingQueue<E>null if unable to peekpublic int fill(MessagePassingQueue.Supplier<E> s, int limit)
MessagePassingQueue
for(int i=0; i < limit && relaxedOffer(s.get()); i++);
There's no strong commitment to the queue being full at the end of a fill. Called from a producer
thread subject to the restrictions appropriate to the implementation.
WARNING: Explicit assumptions are made with regards to MessagePassingQueue.Supplier.get() make sure you have read
and understood these before using this method.
fill in interface MessagePassingQueue<E>public int drain(MessagePassingQueue.Consumer<E> c, int limit, long timeout, java.util.concurrent.TimeUnit unit) throws java.lang.InterruptedException
There's no strong commitment to the queue being empty at the end of it. This implementation is correct for single consumer thread use only.
WARNING: Explicit assumptions are made with regards to Consumer#accept make sure you have read
and understood these before using this method.
java.lang.InterruptedException - if interrupted while waitingjava.lang.IllegalArgumentException - c is nulljava.lang.IllegalArgumentException - if limit is negativepublic int fill(MessagePassingQueue.Supplier<E> s)
MessagePassingQueuewhile(relaxedOffer(s.get());There's no strong commitment to the queue being full at the end of a fill. Called from a producer thread subject to the restrictions appropriate to the implementation.
Unbounded queues will fill up the queue with a fixed amount rather than fill up to oblivion.
WARNING: Explicit assumptions are made with regards to MessagePassingQueue.Supplier.get() make sure you have read
and understood these before using this method.
fill in interface MessagePassingQueue<E>public void fill(MessagePassingQueue.Supplier<E> s, MessagePassingQueue.WaitStrategy wait, MessagePassingQueue.ExitCondition exit)
MessagePassingQueue
int idleCounter = 0;
while (exit.keepRunning()) {
E e = s.get();
while (!relaxedOffer(e)) {
idleCounter = wait.idle(idleCounter);
continue;
}
idleCounter = 0;
}
Called from a producer thread subject to the restrictions appropriate to the implementation. The main difference
being that implementors MUST assure room in the queue is available BEFORE calling MessagePassingQueue.Supplier.get().
WARNING: Explicit assumptions are made with regards to MessagePassingQueue.Supplier.get() make sure you have read
and understood these before using this method.
fill in interface MessagePassingQueue<E>public 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.
WARNING: Explicit assumptions are made with regards to MessagePassingQueue.Consumer.accept(T) make sure you have read
and understood these before using this method.
drain in interface MessagePassingQueue<E>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.
WARNING: Explicit assumptions are made with regards to MessagePassingQueue.Consumer.accept(T) make sure you have read
and understood these before using this method.
drain in interface MessagePassingQueue<E>public void drain(MessagePassingQueue.Consumer<E> c, MessagePassingQueue.WaitStrategy w, 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.
WARNING: Explicit assumptions are made with regards to MessagePassingQueue.Consumer.accept(T) make sure you have read
and understood these before using this method.
drain in interface MessagePassingQueue<E>