Top Interfaces Classes
[default module]

Package rx.internal.util.unsafe

Interface Summary

Modifier and TypeInterface and Description
public interface
MessagePassingQueue<
the event/message type
M>

This is a tagging interface for the queues in this library which implement a subset of the Queue interface sufficient for concurrent message passing.

public interface
QueueProgressIndicators

This interface is provided for monitoring purposes only and is only available on queues where it is easy to provide it.

Class Summary

Modifier and TypeClass and Description
pack-priv abstract class
BaseLinkedQueue<
the element type
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
BaseLinkedQueueProducerNodeRef<E>

public abstract class
ConcurrentCircularArrayQueue<
the element type
E>

A concurrent access enabling class used by circular array based queues this class exposes an offset computation method along with differently memory fenced load/store methods into the underlying array.

pack-priv abstract class
ConcurrentCircularArrayQueueL0Pad<E>

public abstract class
ConcurrentSequencedCircularArrayQueue<E>

public class
MpmcArrayQueue<
type of the element stored in the java.util.Queue
E>

A Multi-Producer-Multi-Consumer queue based on a ConcurrentCircularArrayQueue.

pack-priv abstract class
MpmcArrayQueueConsumerField<E>

pack-priv abstract class
MpmcArrayQueueL1Pad<E>

pack-priv abstract class
MpmcArrayQueueL2Pad<E>

pack-priv abstract class
MpmcArrayQueueProducerField<E>

public class
MpscLinkedQueue<E>

This is a direct Java port of the MPSC algorithm as presented on 1024 Cores by D.

public class
Pow2

public class
SpmcArrayQueue<E>

pack-priv abstract class
SpmcArrayQueueConsumerField<E>

pack-priv abstract class
SpmcArrayQueueL1Pad<E>

pack-priv abstract class
SpmcArrayQueueL2Pad<E>

pack-priv abstract class
SpmcArrayQueueL3Pad<E>

pack-priv abstract class
SpmcArrayQueueMidPad<E>

pack-priv abstract class
SpmcArrayQueueProducerField<E>

pack-priv abstract class
SpmcArrayQueueProducerIndexCacheField<E>

public class
SpscArrayQueue<E>

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

pack-priv abstract class
SpscArrayQueueColdField<E>

pack-priv abstract class
SpscArrayQueueConsumerField<E>

pack-priv abstract class
SpscArrayQueueL1Pad<E>

pack-priv abstract class
SpscArrayQueueL2Pad<E>

pack-priv abstract class
SpscArrayQueueL3Pad<E>

pack-priv abstract class
SpscArrayQueueProducerFields<E>

public class
SpscLinkedQueue<E>

This is a weakened version of the MPSC algorithm as presented on 1024 Cores by D.

public class
SpscUnboundedArrayQueue<E>

pack-priv abstract class
SpscUnboundedArrayQueueConsumerColdField<E>

pack-priv abstract class
SpscUnboundedArrayQueueConsumerField<E>

pack-priv abstract class
SpscUnboundedArrayQueueL2Pad<E>

pack-priv abstract class
SpscUnboundedArrayQueueProducerColdFields<E>

pack-priv abstract class
SpscUnboundedArrayQueueProducerFields<E>

public class
UnsafeAccess

All use of this class MUST first check that UnsafeAccess.isUnsafeAvailable() == true otherwise NPEs will happen in environments without "suc.misc.Unsafe" such as Android.