Class SpmcUnpaddedArrayQueue<E>
- All Implemented Interfaces:
Iterable<E>, Collection<E>, Queue<E>, IndexedQueueSizeUtil.IndexedQueue, MessagePassingQueue<E>, QueueProgressIndicators, SupportsIterator
-
Nested Class Summary
Nested classes/interfaces inherited from interface MessagePassingQueue
MessagePassingQueue.Consumer<T>, MessagePassingQueue.ExitCondition, MessagePassingQueue.Supplier<T>, MessagePassingQueue.WaitStrategy -
Field Summary
Fields inherited from class SpmcUnpaddedArrayQueueConsumerIndexField
C_INDEX_OFFSETFields inherited from class SpmcUnpaddedArrayQueueProducerIndexField
P_INDEX_OFFSETFields inherited from class ConcurrentCircularUnpaddedArrayQueue
buffer, maskFields inherited from interface MessagePassingQueue
UNBOUNDED_CAPACITY -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionintRemove all available item from the queue and hand to consume.intdrain(MessagePassingQueue.Consumer<E> c, int limit) Remove up to limit elements from the queue and hand to consume.voiddrain(MessagePassingQueue.Consumer<E> c, MessagePassingQueue.WaitStrategy w, MessagePassingQueue.ExitCondition exit) Remove elements from the queue and hand to consume forever.intStuff the queue with elements from the supplier.intfill(MessagePassingQueue.Supplier<E> s, int limit) Stuff the queue with up to limit elements from the supplier.voidfill(MessagePassingQueue.Supplier<E> s, MessagePassingQueue.WaitStrategy w, MessagePassingQueue.ExitCondition e) Stuff the queue with elements from the supplier forever.booleanCalled from a producer thread subject to the restrictions appropriate to the implementation and according to theQueue.offer(Object)interface.peek()Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.peek()interface.poll()Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.poll()interface.booleanrelaxedOffer(E e) Called from a producer thread subject to the restrictions appropriate to the implementation.Called from the consumer thread subject to the restrictions appropriate to the implementation.Called from the consumer thread subject to the restrictions appropriate to the implementation.private EremoveElement(E[] buffer, long index, long mask) Methods inherited from class SpmcUnpaddedArrayQueueProducerIndexCacheField
lvProducerIndexCache, svProducerIndexCacheMethods inherited from class SpmcUnpaddedArrayQueueConsumerIndexField
casConsumerIndex, lvConsumerIndexMethods inherited from class SpmcUnpaddedArrayQueueProducerIndexField
lpProducerIndex, lvProducerIndex, soProducerIndexMethods inherited from class ConcurrentCircularUnpaddedArrayQueue
capacity, clear, currentConsumerIndex, currentProducerIndex, isEmpty, iterator, size, toStringMethods inherited from class AbstractQueue
add, addAll, element, removeMethods inherited from class AbstractCollection
contains, containsAll, remove, removeAll, retainAll, toArray, toArrayMethods inherited from class Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface Collection
contains, containsAll, equals, hashCode, parallelStream, remove, removeAll, removeIf, retainAll, spliterator, stream, toArray, toArray, toArray
-
Constructor Details
-
SpmcUnpaddedArrayQueue
public SpmcUnpaddedArrayQueue(int capacity)
-
-
Method Details
-
offer
Description copied from interface:MessagePassingQueueCalled from a producer thread subject to the restrictions appropriate to the implementation and according to theQueue.offer(Object)interface.- Parameters:
e- notnull, will throw NPE if it is- Returns:
- true if element was inserted into the queue, false iff full
-
poll
Description copied from interface:MessagePassingQueueCalled from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.poll()interface.- Returns:
- a message from the queue if one is available,
nulliff empty
-
removeElement
-
peek
Description copied from interface:MessagePassingQueueCalled from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.peek()interface.- Returns:
- a message from the queue if one is available,
nulliff empty
-
relaxedOffer
Description copied from interface:MessagePassingQueueCalled from a producer thread subject to the restrictions appropriate to the implementation. As opposed toQueue.offer(Object)this method may return false without the queue being full.- Parameters:
e- notnull, will throw NPE if it is- Returns:
- true if element was inserted into the queue, false if unable to offer
-
relaxedPoll
Description copied from interface:MessagePassingQueueCalled from the consumer thread subject to the restrictions appropriate to the implementation. As opposed toQueue.poll()this method may returnnullwithout the queue being empty.- Returns:
- a message from the queue if one is available,
nullif unable to poll
-
relaxedPeek
Description copied from interface:MessagePassingQueueCalled from the consumer thread subject to the restrictions appropriate to the implementation. As opposed toQueue.peek()this method may returnnullwithout the queue being empty.- Returns:
- a message from the queue if one is available,
nullif unable to peek
-
drain
Description copied from interface:MessagePassingQueueRemove up to limit elements from the queue and hand to consume. This should be semantically similar to: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.- Returns:
- the number of polled elements
-
fill
Description copied from interface:MessagePassingQueueStuff the queue with up to limit elements from the supplier. Semantically similar to: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.- Returns:
- the number of offered elements
-
drain
Description copied from interface:MessagePassingQueueRemove all available item from the queue and hand to consume. This should be semantically similar to: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.- Returns:
- the number of polled elements
-
fill
Description copied from interface:MessagePassingQueueStuff the queue with elements from the supplier. Semantically similar to:while(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.- Returns:
- the number of offered elements
-
drain
public void drain(MessagePassingQueue.Consumer<E> c, MessagePassingQueue.WaitStrategy w, MessagePassingQueue.ExitCondition exit) Description copied from interface:MessagePassingQueueRemove elements from the queue and hand to consume forever. Semantically similar to: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. -
fill
public void fill(MessagePassingQueue.Supplier<E> s, MessagePassingQueue.WaitStrategy w, MessagePassingQueue.ExitCondition e) Description copied from interface:MessagePassingQueueStuff the queue with elements from the supplier forever. Semantically similar to: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 toMessagePassingQueue.Supplier.get()make sure you have read and understood these before using this method.
-