io.smallrye.mutiny.helpers.queues

Class SpscArrayQueue<E>

java.lang.Object

java.util.concurrent.atomic.AtomicReferenceArray<E>

io.smallrye.mutiny.helpers.queues.SpscArrayQueue<E>

Type Parameters:

E - the element type of the queue

All Implemented Interfaces:

Serializable, Iterable<E>, Collection<E>, Queue<E>

public final class SpscArrayQueue<E>
extends AtomicReferenceArray<E>
implements Queue<E>

A Single-Producer-Single-Consumer queue backed by a pre-allocated buffer.

Code inspired from https://github.com/JCTools/JCTools/blob/master/jctools-core/src/main/java/org/jctools/queues/atomic, and it's RX Java 2 version.

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
SpscArrayQueue(int capacity)

Method Summary

Modifier and Type	Method and Description
boolean	add(E e)
boolean	addAll(Collection<? extends E> c)
void	clear()
boolean	contains(Object o)
boolean	containsAll(Collection<?> c)
E	element()
boolean	isEmpty()
Iterator<E>	iterator()
boolean	offer(E e)
E	peek()
E	poll()
E	remove()
boolean	remove(Object o)
boolean	removeAll(Collection<?> c)
boolean	retainAll(Collection<?> c)
static int	roundToPowerOfTwo(int value) Find the next larger positive power of two value up from the given value.
int	size()
Object[]	toArray()
<R> R[]	toArray(R[] a)

Methods inherited from class java.util.concurrent.atomic.AtomicReferenceArray

accumulateAndGet, compareAndSet, get, getAndAccumulate, getAndSet, getAndUpdate, lazySet, length, set, toString, updateAndGet, weakCompareAndSet

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Collection

equals, hashCode, parallelStream, removeIf, spliterator, stream

Methods inherited from interface java.lang.Iterable

forEach

Constructor Detail

SpscArrayQueue

public SpscArrayQueue(int capacity)

Method Detail

roundToPowerOfTwo

public static int roundToPowerOfTwo(int value)

Find the next larger positive power of two value up from the given value. If value is a power of two then this value will be returned.

Parameters:

value - from which next positive power of two will be found.

Returns:

the next positive power of 2 or this value if it is a power of 2.

offer

public boolean offer(E e)

Specified by:

offer in interface Queue<E>

poll

public E poll()

Specified by:

poll in interface Queue<E>

size

public int size()

Specified by:

size in interface Collection<E>

peek

public E peek()

Specified by:

peek in interface Queue<E>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Collection<E>

clear

public void clear()

Specified by:

clear in interface Collection<E>

contains

public boolean contains(Object o)

Specified by:

contains in interface Collection<E>

iterator

public Iterator<E> iterator()

Specified by:

iterator in interface Iterable<E>

Specified by:

iterator in interface Collection<E>

toArray

public Object[] toArray()

Specified by:

toArray in interface Collection<E>

toArray

public <R> R[] toArray(R[] a)

Specified by:

toArray in interface Collection<E>

remove

public boolean remove(Object o)

Specified by:

remove in interface Collection<E>

containsAll

public boolean containsAll(Collection<?> c)

Specified by:

containsAll in interface Collection<E>

addAll

public boolean addAll(Collection<? extends E> c)

Specified by:

addAll in interface Collection<E>

removeAll

public boolean removeAll(Collection<?> c)

Specified by:

removeAll in interface Collection<E>

retainAll

public boolean retainAll(Collection<?> c)

Specified by:

retainAll in interface Collection<E>

add

public boolean add(E e)

Specified by:

add in interface Collection<E>

Specified by:

add in interface Queue<E>

remove

public E remove()

Specified by:

remove in interface Queue<E>

element

public E element()

Specified by:

element in interface Queue<E>