rsocket-core 1.1.4 · io.rsocket.internal.jctools.queues

Interface Summary

Modifier and Type	Interface and Description
public interface	MessagePassingQueue< the event/message type T> Message passing queues are intended for concurrent method passing.
pack-priv interface	PortableJvmInfo JVM Information that is standard and available on all JVMs (i.e. does not use unsafe)
public interface	QueueProgressIndicators This interface is provided for monitoring purposes only and is only available on queues where it is easy to provide it.

Modifier and Type	Class and Description
pack-priv abstract class	BaseLinkedQueue<E> A base data structure for concurrent linked queues.
pack-priv abstract class	BaseLinkedQueueConsumerNodeRef<E>
pack-priv abstract class	BaseLinkedQueuePad0<E>
pack-priv abstract class	BaseLinkedQueuePad1<E>
pack-priv abstract class	BaseLinkedQueuePad2<E>
pack-priv abstract class	BaseLinkedQueueProducerNodeRef<E>
pack-priv abstract class	BaseMpscLinkedArrayQueue<E> An MPSC array queue which starts at initialCapacity and grows to maxCapacity in linked chunks of the initial size.
pack-priv abstract class	BaseMpscLinkedArrayQueueColdProducerFields<E>
pack-priv abstract class	BaseMpscLinkedArrayQueueConsumerFields<E>
pack-priv abstract class	BaseMpscLinkedArrayQueuePad1<E>
pack-priv abstract class	BaseMpscLinkedArrayQueuePad2<E>
pack-priv abstract class	BaseMpscLinkedArrayQueuePad3<E>
pack-priv abstract class	BaseMpscLinkedArrayQueueProducerFields<E>
pack-priv class	IndexedQueueSizeUtil
pack-priv class	LinkedArrayQueueUtil This is used for method substitution in the LinkedArray classes code generation.
pack-priv class	LinkedQueueNode<E>
pack-priv class	MessagePassingQueueUtil
public class	MpscUnboundedArrayQueue<E> An MPSC array queue which starts at initialCapacity and grows indefinitely in linked chunks of the initial size.
pack-priv class	Pow2 Power of 2 utility functions.
pack-priv class	RangeUtil
pack-priv class	UnsafeAccess Why should we resort to using Unsafe?
pack-priv class	UnsafeRefArrayAccess