Package org.jctools.queues.atomic

Class MpscGrowableAtomicArrayQueue<E>

java.lang.Object
java.util.AbstractCollection<E>
java.util.AbstractQueue<E>
org.jctools.queues.atomic.BaseMpscLinkedAtomicArrayQueuePad1<E>
org.jctools.queues.atomic.BaseMpscLinkedAtomicArrayQueueProducerFields<E>
org.jctools.queues.atomic.BaseMpscLinkedAtomicArrayQueuePad2<E>
org.jctools.queues.atomic.BaseMpscLinkedAtomicArrayQueueConsumerFields<E>
org.jctools.queues.atomic.BaseMpscLinkedAtomicArrayQueuePad3<E>
org.jctools.queues.atomic.BaseMpscLinkedAtomicArrayQueueColdProducerFields<E>
org.jctools.queues.atomic.BaseMpscLinkedAtomicArrayQueue<E>
org.jctools.queues.atomic.MpscChunkedAtomicArrayQueueColdProducerFields<E>
org.jctools.queues.atomic.MpscChunkedAtomicArrayQueue<E>
org.jctools.queues.atomic.MpscGrowableAtomicArrayQueue<E>
All Implemented Interfaces:
Iterable<E>, Collection<E>, Queue<E>, IndexedQueueSizeUtil.IndexedQueue, MessagePassingQueue<E>, QueueProgressIndicators
public class MpscGrowableAtomicArrayQueue<E> extends MpscChunkedAtomicArrayQueue<E>
NOTE: This class was automatically generated by org.jctools.queues.atomic.JavaParsingAtomicLinkedQueueGenerator which can found in the jctools-build module. The original source file is MpscGrowableArrayQueue.java. An MPSC array queue which starts at initialCapacity and grows to maxCapacity in linked chunks, doubling theirs size every time until the full blown backing array is used. 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.

  • Constructor Details

    • MpscGrowableAtomicArrayQueue

      public MpscGrowableAtomicArrayQueue(int maxCapacity)

    • MpscGrowableAtomicArrayQueue

      public MpscGrowableAtomicArrayQueue(int initialCapacity, int maxCapacity)
      Parameters:
      initialCapacity - the queue initial capacity. If chunk size is fixed this will be the chunk size. Must be 2 or more.
      maxCapacity - the maximum capacity will be rounded up to the closest power of 2 and will be the upper limit of number of elements in this queue. Must be 4 or more and round up to a larger power of 2 than initialCapacity.

  • Method Details