Class MpscUnboundedArrayQueue<E>
- java.lang.Object
-
- java.util.AbstractCollection<E>
-
- java.util.AbstractQueue<E>
-
- org.jctools.queues.MpscUnboundedArrayQueue<E>
-
- All Implemented Interfaces:
Iterable<E>,Collection<E>,Queue<E>,IndexedQueueSizeUtil.IndexedQueue,MessagePassingQueue<E>,QueueProgressIndicators
public class MpscUnboundedArrayQueue<E> extends AbstractQueue<E>
An MPSC array queue which starts at initialCapacity and grows indefinitely in linked chunks of the initial size. The queue grows only when the current chunk is full and elements are not copied on resize, instead a link to the new chunk is stored in the old chunk for the consumer to follow.
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from interface org.jctools.queues.MessagePassingQueue
MessagePassingQueue.Consumer<T>, MessagePassingQueue.ExitCondition, MessagePassingQueue.Supplier<T>, MessagePassingQueue.WaitStrategy
-
-
Field Summary
Fields Modifier and Type Field Description protected E[]consumerBufferprotected longconsumerMaskprotected E[]producerBufferprotected longproducerMask-
Fields inherited from interface org.jctools.queues.MessagePassingQueue
UNBOUNDED_CAPACITY
-
-
Constructor Summary
Constructors Constructor Description MpscUnboundedArrayQueue(int chunkSize)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description protected longavailableInQueue(long pIndex, long cIndex)intcapacity()longcurrentConsumerIndex()This method has no concurrent visibility semantics.longcurrentProducerIndex()This method has no concurrent visibility semantics.intdrain(MessagePassingQueue.Consumer<E> c)Remove 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 wait, MessagePassingQueue.ExitCondition exit)Remove elements from the queue and hand to consume forever.intfill(MessagePassingQueue.Supplier<E> s)Stuff 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 wait, MessagePassingQueue.ExitCondition exit)Stuff the queue with elements from the supplier forever.protected longgetCurrentBufferCapacity(long mask)protected intgetNextBufferSize(E[] buffer)booleanisEmpty()This method's accuracy is subject to concurrent modifications happening as the observation is carried out.Iterator<E>iterator()Get an iterator for this queue.longlvConsumerIndex()longlvProducerIndex()booleanoffer(E e)Called from a producer thread subject to the restrictions appropriate to the implementation and according to theQueue.offer(Object)interface.Epeek()Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.peek()interface.Epoll()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.ErelaxedPeek()Called from the consumer thread subject to the restrictions appropriate to the implementation.ErelaxedPoll()Called from the consumer thread subject to the restrictions appropriate to the implementation.intsize()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.StringtoString()-
Methods inherited from class java.util.AbstractCollection
contains, containsAll, remove, removeAll, retainAll, toArray, toArray
-
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface java.util.Collection
contains, containsAll, equals, hashCode, parallelStream, remove, removeAll, removeIf, retainAll, spliterator, stream, toArray, toArray, toArray
-
Methods inherited from interface org.jctools.queues.MessagePassingQueue
clear
-
-
-
-
Method Detail
-
availableInQueue
protected long availableInQueue(long pIndex, long cIndex)- Returns:
- available elements in queue * 2
-
capacity
public int capacity()
- Specified by:
capacityin interfaceIndexedQueueSizeUtil.IndexedQueue- Specified by:
capacityin interfaceMessagePassingQueue<E>- Returns:
- the capacity of this queue or
MessagePassingQueue.UNBOUNDED_CAPACITYif not bounded
-
drain
public int drain(MessagePassingQueue.Consumer<E> c)
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.- Specified by:
drainin interfaceMessagePassingQueue<E>- Returns:
- the number of polled elements
-
fill
public int fill(MessagePassingQueue.Supplier<E> s)
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.- Specified by:
fillin interfaceMessagePassingQueue<E>- Returns:
- the number of offered elements
-
getNextBufferSize
protected int getNextBufferSize(E[] buffer)
- Returns:
- next buffer size(inclusive of next array pointer)
-
getCurrentBufferCapacity
protected long getCurrentBufferCapacity(long mask)
- Returns:
- current buffer capacity for elements (excluding next pointer and jump entry) * 2
-
size
public int size()
Description copied from interface:MessagePassingQueueThis 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. For some implementations this method may be O(n) rather than O(1).- Specified by:
sizein interfaceCollection<E>- Specified by:
sizein interfaceMessagePassingQueue<E>- Specified by:
sizein classAbstractCollection<E>- Returns:
- number of messages in the queue, between 0 and
Integer.MAX_VALUEbut less or equals to capacity (if bounded).
-
isEmpty
public boolean isEmpty()
Description copied from interface:MessagePassingQueueThis method's accuracy is subject to concurrent modifications happening as the observation is carried out.- Specified by:
isEmptyin interfaceCollection<E>- Specified by:
isEmptyin interfaceMessagePassingQueue<E>- Overrides:
isEmptyin classAbstractCollection<E>- Returns:
- true if empty, false otherwise
-
toString
public String toString()
- Overrides:
toStringin classAbstractCollection<E>
-
offer
public boolean offer(E e)
Description copied from interface:MessagePassingQueueCalled from a producer thread subject to the restrictions appropriate to the implementation and according to theQueue.offer(Object)interface.- Specified by:
offerin interfaceMessagePassingQueue<E>- Specified by:
offerin interfaceQueue<E>- Parameters:
e- notnull, will throw NPE if it is- Returns:
- true if element was inserted into the queue, false iff full
-
poll
public E poll()
Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.poll()interface.This implementation is correct for single consumer thread use only.
- Specified by:
pollin interfaceMessagePassingQueue<E>- Specified by:
pollin interfaceQueue<E>- Returns:
- a message from the queue if one is available,
nulliff empty
-
peek
public E peek()
Called from the consumer thread subject to the restrictions appropriate to the implementation and according to theQueue.peek()interface.This implementation is correct for single consumer thread use only.
- Specified by:
peekin interfaceMessagePassingQueue<E>- Specified by:
peekin interfaceQueue<E>- Returns:
- a message from the queue if one is available,
nulliff empty
-
currentProducerIndex
public long currentProducerIndex()
Description copied from interface:QueueProgressIndicatorsThis method has no concurrent visibility semantics. The value returned may be negative. Under normal circumstances 2 consecutive calls to this method can offer an idea of progress made by producer threads by subtracting the 2 results though in extreme cases (if producers have progressed by more than 2^64) this may also fail.
This value will normally indicate number of elements passed into the queue, but may under some circumstances be a derivative of that figure. This method should not be used to derive size or emptiness.- Specified by:
currentProducerIndexin interfaceQueueProgressIndicators- Returns:
- the current value of the producer progress index
-
currentConsumerIndex
public long currentConsumerIndex()
Description copied from interface:QueueProgressIndicatorsThis method has no concurrent visibility semantics. The value returned may be negative. Under normal circumstances 2 consecutive calls to this method can offer an idea of progress made by consumer threads by subtracting the 2 results though in extreme cases (if consumers have progressed by more than 2^64) this may also fail.
This value will normally indicate number of elements taken out of the queue, but may under some circumstances be a derivative of that figure. This method should not be used to derive size or emptiness.- Specified by:
currentConsumerIndexin interfaceQueueProgressIndicators- Returns:
- the current value of the consumer progress index
-
relaxedOffer
public boolean relaxedOffer(E e)
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.- Specified by:
relaxedOfferin interfaceMessagePassingQueue<E>- Parameters:
e- notnull, will throw NPE if it is- Returns:
- true if element was inserted into the queue, false if unable to offer
-
relaxedPoll
public E 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.- Specified by:
relaxedPollin interfaceMessagePassingQueue<E>- Returns:
- a message from the queue if one is available,
nullif unable to poll
-
relaxedPeek
public E 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.- Specified by:
relaxedPeekin interfaceMessagePassingQueue<E>- Returns:
- a message from the queue if one is available,
nullif unable to peek
-
fill
public int fill(MessagePassingQueue.Supplier<E> s, int limit)
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.- Specified by:
fillin interfaceMessagePassingQueue<E>- Returns:
- the number of offered elements
-
fill
public void fill(MessagePassingQueue.Supplier<E> s, MessagePassingQueue.WaitStrategy wait, MessagePassingQueue.ExitCondition exit)
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.- Specified by:
fillin interfaceMessagePassingQueue<E>
-
drain
public int drain(MessagePassingQueue.Consumer<E> c, int limit)
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.- Specified by:
drainin interfaceMessagePassingQueue<E>- Returns:
- the number of polled elements
-
drain
public void drain(MessagePassingQueue.Consumer<E> c, MessagePassingQueue.WaitStrategy wait, 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.- Specified by:
drainin interfaceMessagePassingQueue<E>
-
iterator
public Iterator<E> iterator()
Get an iterator for this queue. This method is thread safe.The iterator provides a best-effort snapshot of the elements in the queue. The returned iterator is not guaranteed to return elements in queue order, and races with the consumer thread may cause gaps in the sequence of returned elements. Like {link #relaxedPoll}, the iterator may not immediately return newly inserted elements.
- Specified by:
iteratorin interfaceCollection<E>- Specified by:
iteratorin interfaceIterable<E>- Specified by:
iteratorin classAbstractCollection<E>- Returns:
- The iterator.
-
lvConsumerIndex
public final long lvConsumerIndex()
-
lvProducerIndex
public final long lvProducerIndex()
-
-