hu.akarnokd.rxjava2.internal.queue.SpscExactArrayQueue Maven / Gradle / Ivy
/**
* Copyright 2015 David Karnok and Netflix, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in
* compliance with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under the License is
* distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See
* the License for the specific language governing permissions and limitations under the License.
*/
/*
* The code was inspired by the similarly named JCTools class:
* https://github.com/JCTools/JCTools/blob/master/jctools-core/src/main/java/org/jctools/queues/atomic
*/
package hu.akarnokd.rxjava2.internal.queue;
import java.util.*;
import java.util.concurrent.atomic.*;
import hu.akarnokd.rxjava2.internal.functions.Objects;
import hu.akarnokd.rxjava2.internal.util.Pow2;
/**
* A single-producer single-consumer array-backed queue with exact, non power-of-2 logical capacity.
* @param the contained value type
*/
public final class SpscExactArrayQueue extends AtomicReferenceArray implements Queue {
/** */
private static final long serialVersionUID = 6210984603741293445L;
final int mask;
final int capacitySkip;
volatile long producerIndex;
volatile long consumerIndex;
@SuppressWarnings("rawtypes")
static final AtomicLongFieldUpdater PRODUCER_INDEX =
AtomicLongFieldUpdater.newUpdater(SpscExactArrayQueue.class, "producerIndex");
@SuppressWarnings("rawtypes")
static final AtomicLongFieldUpdater CONSUMER_INDEX =
AtomicLongFieldUpdater.newUpdater(SpscExactArrayQueue.class, "consumerIndex");
public SpscExactArrayQueue(int capacity) {
super(Pow2.roundToPowerOfTwo(capacity));
int len = length();
this.mask = len - 1;
this.capacitySkip = len - capacity;
}
@Override
public boolean offer(T value) {
Objects.requireNonNull(value, "value is null");
long pi = producerIndex;
int m = mask;
int fullCheck = (int)(pi + capacitySkip) & m;
if (get(fullCheck) != null) {
return false;
}
int offset = (int)pi & m;
PRODUCER_INDEX.lazySet(this, pi + 1);
lazySet(offset, value);
return true;
}
@Override
public T poll() {
long ci = consumerIndex;
int offset = (int)ci & mask;
T value = get(offset);
if (value == null) {
return null;
}
CONSUMER_INDEX.lazySet(this, ci + 1);
lazySet(offset, null);
return value;
}
@Override
public T peek() {
return get((int)consumerIndex & mask);
}
@Override
public void clear() {
while (poll() != null || !isEmpty());
}
@Override
public boolean isEmpty() {
return producerIndex == consumerIndex;
}
@Override
public int size() {
long ci = consumerIndex;
for (;;) {
long pi = producerIndex;
long ci2 = consumerIndex;
if (ci == ci2) {
return (int)(pi - ci2);
}
ci = ci2;
}
}
@Override
public boolean contains(Object o) {
throw new UnsupportedOperationException();
}
@Override
public Iterator iterator() {
throw new UnsupportedOperationException();
}
@Override
public Object[] toArray() {
throw new UnsupportedOperationException();
}
@Override
public E[] toArray(E[] a) {
throw new UnsupportedOperationException();
}
@Override
public boolean remove(Object o) {
throw new UnsupportedOperationException();
}
@Override
public boolean containsAll(Collection> c) {
throw new UnsupportedOperationException();
}
@Override
public boolean addAll(Collection extends T> c) {
throw new UnsupportedOperationException();
}
@Override
public boolean removeAll(Collection> c) {
throw new UnsupportedOperationException();
}
@Override
public boolean retainAll(Collection> c) {
throw new UnsupportedOperationException();
}
@Override
public boolean add(T e) {
throw new UnsupportedOperationException();
}
@Override
public T remove() {
throw new UnsupportedOperationException();
}
@Override
public T element() {
throw new UnsupportedOperationException();
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy