Uses of Interface
io.reactivex.rxjava3.operators.SimplePlainQueue
Packages that use SimplePlainQueue
Package
Description
Classes and interfaces for writing advanced operators within and outside RxJava.
-
Uses of SimplePlainQueue in io.reactivex.rxjava3.internal.observers
Fields in io.reactivex.rxjava3.internal.observers declared as SimplePlainQueueConstructors in io.reactivex.rxjava3.internal.observers with parameters of type SimplePlainQueueModifierConstructorDescriptionQueueDrainObserver(Observer<? super V> actual, SimplePlainQueue<U> queue) -
Uses of SimplePlainQueue in io.reactivex.rxjava3.internal.queue
Classes in io.reactivex.rxjava3.internal.queue that implement SimplePlainQueueModifier and TypeClassDescriptionfinal classA multi-producer single consumer unbounded queue. -
Uses of SimplePlainQueue in io.reactivex.rxjava3.internal.subscribers
Fields in io.reactivex.rxjava3.internal.subscribers declared as SimplePlainQueueConstructors in io.reactivex.rxjava3.internal.subscribers with parameters of type SimplePlainQueueModifierConstructorDescriptionQueueDrainSubscriber(org.reactivestreams.Subscriber<? super V> actual, SimplePlainQueue<U> queue) -
Uses of SimplePlainQueue in io.reactivex.rxjava3.internal.util
Methods in io.reactivex.rxjava3.internal.util with parameters of type SimplePlainQueueModifier and TypeMethodDescriptionstatic <T,U> void QueueDrainHelper.drainLoop(SimplePlainQueue<T> q, Observer<? super U> a, boolean delayError, Disposable dispose, ObservableQueueDrain<T, U> qd) static <T,U> void QueueDrainHelper.drainMaxLoop(SimplePlainQueue<T> q, org.reactivestreams.Subscriber<? super U> a, boolean delayError, Disposable dispose, QueueDrain<T, U> qd) Drain the queue but give up with an error if there aren't enough requests. -
Uses of SimplePlainQueue in io.reactivex.rxjava3.operators
Classes in io.reactivex.rxjava3.operators that implement SimplePlainQueueModifier and TypeClassDescriptionfinal classA Single-Producer-Single-Consumer queue backed by a pre-allocated buffer.final classA single-producer single-consumer array-backed queue which can allocate new arrays in case the consumer is slower than the producer.