io.reactivex.observable.internal.queues.SpscArrayQueue Maven / Gradle / Ivy
Show all versions of rxjava3-observable Show documentation
/**
* Copyright (c) 2016-present, RxJava Contributors.
*
* 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.
*/
package io.reactivex.observable.internal.queues;
import io.reactivex.common.internal.queues.AbstractSpscArrayQueue;
import io.reactivex.observable.extensions.SimplePlainQueue;
/*
* 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
*/
/**
* A Single-Producer-Single-Consumer queue backed by a pre-allocated buffer.
*
* This implementation is a mashup of the Fast Flow
* algorithm with an optimization of the offer method taken from the BQueue algorithm (a variation on Fast
* Flow), and adjusted to comply with Queue.offer semantics with regards to capacity.
* For convenience the relevant papers are available in the resources folder:
* 2010 - Pisa - SPSC Queues on Shared Cache Multi-Core Systems.pdf
* 2012 - Junchang- BQueue- Efficient and Practical Queuing.pdf
* This implementation is wait free.
*
* @param the element type of the queue
*/
public final class SpscArrayQueue extends AbstractSpscArrayQueue
implements SimplePlainQueue {
private static final long serialVersionUID = -1296597691183856449L;
public SpscArrayQueue(int capacity) {
super(capacity);
}
}