| Class | Description |
|---|---|
| AtomicQueueFactory |
The queue factory produces
Queue instances based on a best fit to the ConcurrentQueueSpec. |
| BaseMpscLinkedAtomicArrayQueue<E> |
An MPSC array queue which starts at initialCapacity and grows to maxCapacity in linked chunks
of the initial size.
|
| LinkedQueueAtomicNode<E> | |
| MpmcAtomicArrayQueue<E> | |
| MpscAtomicArrayQueue<E> |
A Multi-Producer-Single-Consumer queue based on a
AtomicReferenceArrayQueue. |
| MpscChunkedAtomicArrayQueue<E> |
An MPSC array queue which starts at initialCapacity and grows to maxCapacity in linked chunks
of the initial size.
|
| MpscGrowableAtomicArrayQueue<E> |
An MPSC array queue which starts at initialCapacity and grows to maxCapacity in linked chunks
of the initial size.
|
| MpscLinkedAtomicQueue<E> |
This is a direct Java port of the MPSC algorithm as presented on 1024
Cores by D.
|
| MpscUnboundedAtomicArrayQueue<E> |
An MPSC array queue which starts at initialCapacity and grows to maxCapacity in linked chunks
of the initial size.
|
| SpmcAtomicArrayQueue<E> |
A single-producer multiple-consumer AtomicReferenceArray-backed queue.
|
| SpscAtomicArrayQueue<E> |
A Single-Producer-Single-Consumer queue backed by a pre-allocated buffer.
|
| SpscChunkedAtomicArrayQueue<E> | |
| SpscGrowableAtomicArrayQueue<E> | |
| SpscLinkedAtomicQueue<E> |
This is a weakened version of the MPSC algorithm as presented on 1024
Cores by D.
|
| SpscUnboundedAtomicArrayQueue<E> |
Copyright © 2013–2017. All rights reserved.