RxJava 2 2.2.21 · io.reactivex.internal.queue.SpscLinkedArrayQueue

Modifier and Type	Field and Description
pack-priv AtomicReferenceArray<Object>	consumerBuffer
pack-priv final AtomicLong	consumerIndex
pack-priv final int	consumerMask
private static final Object	HAS_NEXT
pack-priv static final int	MAX_LOOK_AHEAD_STEP
pack-priv AtomicReferenceArray<Object>	producerBuffer
pack-priv final AtomicLong	producerIndex
pack-priv long	producerLookAhead
pack-priv int	producerLookAheadStep
pack-priv final int	producerMask

Access	Constructor and Description
public	SpscLinkedArrayQueue(final int bufferSize)

Method Summary

Modifier and Type	Method and Description
private void	adjustLookAheadStep(int capacity)
private static int	calcDirectOffset(int index)
private static int	calcWrappedOffset(long index, int mask)
public void	clear() Implements io.reactivex.internal.fuseable.SimpleQueue.clear. Removes all enqueued items from this queue.
public boolean	isEmpty() Implements io.reactivex.internal.fuseable.SimpleQueue.isEmpty. Returns true if the queue is empty.
private long	lpConsumerIndex()
private long	lpProducerIndex()
private long	lvConsumerIndex()
private static <E> Object	lvElement(AtomicReferenceArray<Object> buffer, int offset)
private AtomicReferenceArray<Object>	lvNextBufferAndUnlink(AtomicReferenceArray<Object> curr, int nextIndex)
private long	lvProducerIndex()
private T	newBufferPeek(AtomicReferenceArray<Object> nextBuffer, final long index, final int mask)
private T	newBufferPoll(AtomicReferenceArray<Object> nextBuffer, final long index, final int mask)
public boolean	offer(final T the value to enqueue, not null e) Implements io.reactivex.internal.fuseable.SimpleQueue.offer. Atomically enqueue a single.
public boolean	Returns: true if the queue accepted the two new values offer(T the first value, not null first, T the second value, not null second) Implements io.reactivex.internal.fuseable.SimpleQueue.offer. Offer two elements at the same time.
public T	peek()
public T	poll() Implements io.reactivex.internal.fuseable.SimplePlainQueue.poll. Tries to dequeue a value (non-null) or returns null if the queue is empty.
private void	resize(final AtomicReferenceArray<Object> oldBuffer, final long currIndex, final int offset, final T e, final long mask)
public int	size()
private void	soConsumerIndex(long v)
private static void	soElement(AtomicReferenceArray<Object> buffer, int offset, Object e)
private void	soNext(AtomicReferenceArray<Object> curr, AtomicReferenceArray<Object> next)
private void	soProducerIndex(long v)
private boolean	writeToQueue(final AtomicReferenceArray<Object> buffer, final T e, final long index, final int offset)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

consumerBuffer	back to summary
pack-priv AtomicReferenceArray<Object> consumerBuffer

consumerIndex	back to summary
pack-priv final AtomicLong consumerIndex

consumerMask	back to summary
pack-priv final int consumerMask

HAS_NEXT	back to summary
private static final Object HAS_NEXT

MAX_LOOK_AHEAD_STEP	back to summary
pack-priv static final int MAX_LOOK_AHEAD_STEP

producerBuffer	back to summary
pack-priv AtomicReferenceArray<Object> producerBuffer

producerIndex	back to summary
pack-priv final AtomicLong producerIndex

producerLookAhead	back to summary
pack-priv long producerLookAhead

producerLookAheadStep	back to summary
pack-priv int producerLookAheadStep

producerMask	back to summary
pack-priv final int producerMask

SpscLinkedArrayQueue	back to summary
public SpscLinkedArrayQueue(final int bufferSize)

Method Detail

adjustLookAheadStep	back to summary
private void adjustLookAheadStep(int capacity)

calcDirectOffset	back to summary
private static int calcDirectOffset(int index)

calcWrappedOffset	back to summary
private static int calcWrappedOffset(long index, int mask)

clear	back to summary
public void clear() Implements io.reactivex.internal.fuseable.SimpleQueue.clear. Doc from io.reactivex.internal.fuseable.SimpleQueue.clear. Removes all enqueued items from this queue. Annotations @Override

clear

back to summary

public void clear()

Implements io.reactivex.internal.fuseable.SimpleQueue.clear.

Doc from io.reactivex.internal.fuseable.SimpleQueue.clear.

Removes all enqueued items from this queue.

Annotations

@Override

isEmpty back to summary

isEmpty	back to summary
public boolean isEmpty() Implements io.reactivex.internal.fuseable.SimpleQueue.isEmpty. Doc from io.reactivex.internal.fuseable.SimpleQueue.isEmpty. Returns true if the queue is empty. Note however that due to potential fused functions in `poll()` it is possible this method returns false but then poll() returns null because the fused function swallowed the available item(s). Returns:boolean true if the queue is empty Annotations @Override

public boolean isEmpty()

Implements io.reactivex.internal.fuseable.SimpleQueue.isEmpty.

Doc from io.reactivex.internal.fuseable.SimpleQueue.isEmpty.

Returns true if the queue is empty.

Note however that due to potential fused functions in poll() it is possible this method returns false but then poll() returns null because the fused function swallowed the available item(s).

Returns:boolean

true if the queue is empty

Annotations

@Override

lpConsumerIndex	back to summary
private long lpConsumerIndex()

lpProducerIndex	back to summary
private long lpProducerIndex()

lvConsumerIndex	back to summary
private long lvConsumerIndex()

lvElement	back to summary
private static <E> Object lvElement(AtomicReferenceArray<Object> buffer, int offset)

lvNextBufferAndUnlink	back to summary
private AtomicReferenceArray<Object> lvNextBufferAndUnlink(AtomicReferenceArray<Object> curr, int nextIndex) Annotations @SuppressWarnings:unchecked

lvProducerIndex	back to summary
private long lvProducerIndex()

newBufferPeek	back to summary
private T newBufferPeek(AtomicReferenceArray<Object> nextBuffer, final long index, final int mask) Annotations @SuppressWarnings:unchecked

newBufferPoll	back to summary
private T newBufferPoll(AtomicReferenceArray<Object> nextBuffer, final long index, final int mask) Annotations @SuppressWarnings:unchecked

offer	back to summary
public boolean offer(final T e) Implements io.reactivex.internal.fuseable.SimpleQueue.offer. Doc from io.reactivex.internal.fuseable.SimpleQueue.offer. Atomically enqueue a single. This implementation is correct for single producer thread use only. Parameters e:T the value to enqueue, not null Returns:boolean true if successful, false if the value was not enqueued likely due to reaching the queue capacity) Annotations @Override

offer

back to summary

public boolean offer(final T e)

Implements io.reactivex.internal.fuseable.SimpleQueue.offer.

Doc from io.reactivex.internal.fuseable.SimpleQueue.offer.

Atomically enqueue a single.

This implementation is correct for single producer thread use only.

Parameters

e:T: the value to enqueue, not null

Returns:boolean

true if successful, false if the value was not enqueued likely due to reaching the queue capacity)

Annotations

@Override

offer	back to summary
public boolean offer(T first, T second) Implements io.reactivex.internal.fuseable.SimpleQueue.offer. Offer two elements at the same time. Don't use the regular offer() with this at all! Parameters first:T the first value, not null second:T the second value, not null Returns:boolean true if the queue accepted the two new values Annotations @Override

offer

back to summary

public boolean offer(T first, T second)

Implements io.reactivex.internal.fuseable.SimpleQueue.offer.

Offer two elements at the same time.

Don't use the regular offer() with this at all!

Parameters

first:T: the first value, not null
second:T: the second value, not null

Returns:boolean

true if the queue accepted the two new values

Annotations

@Override

peek	back to summary
public T peek() Annotations @SuppressWarnings:unchecked

poll back to summary

poll	back to summary
public T poll() Implements io.reactivex.internal.fuseable.SimplePlainQueue.poll. Doc from io.reactivex.internal.fuseable.SimpleQueue.poll. Tries to dequeue a value (non-null) or returns null if the queue is empty. If the producer uses `offer(Object, Object)` and when polling in pairs, if the first poll() returns a non-null item, the second poll() is guaranteed to return a non-null item as well. This implementation is correct for single consumer thread use only. Returns:T the item or null to indicate an empty queue Annotations @Nullable @SuppressWarnings:unchecked @Override

public T poll()

Implements io.reactivex.internal.fuseable.SimplePlainQueue.poll.

Doc from io.reactivex.internal.fuseable.SimpleQueue.poll.

Tries to dequeue a value (non-null) or returns null if the queue is empty.

If the producer uses offer(Object, Object) and when polling in pairs, if the first poll() returns a non-null item, the second poll() is guaranteed to return a non-null item as well.

This implementation is correct for single consumer thread use only.

Returns:T

the item or null to indicate an empty queue

Annotations

@Nullable
@SuppressWarnings:unchecked
@Override

resize	back to summary
private void resize(final AtomicReferenceArray<Object> oldBuffer, final long currIndex, final int offset, final T e, final long mask)

size	back to summary
public int size()

soConsumerIndex	back to summary
private void soConsumerIndex(long v)

soElement	back to summary
private static void soElement(AtomicReferenceArray<Object> buffer, int offset, Object e)

soNext	back to summary
private void soNext(AtomicReferenceArray<Object> curr, AtomicReferenceArray<Object> next)

soProducerIndex	back to summary
private void soProducerIndex(long v)

writeToQueue	back to summary
private boolean writeToQueue(final AtomicReferenceArray<Object> buffer, final T e, final long index, final int offset)

public final Class SpscLinkedArrayQueue<T>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail