io.reactivex.rxjava3.internal.operators.flowable.FlowableConcatMapScheduler Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of redisson-all Show documentation
Show all versions of redisson-all Show documentation
Easy Redis Java client and Real-Time Data Platform. Valkey compatible. Sync/Async/RxJava3/Reactive API. Client side caching. Over 50 Redis based Java objects and services: JCache API, Apache Tomcat, Hibernate, Spring, Set, Multimap, SortedSet, Map, List, Queue, Deque, Semaphore, Lock, AtomicLong, Map Reduce, Bloom filter, Scheduler, RPC
/*
* 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.rxjava3.internal.operators.flowable;
import java.util.Objects;
import java.util.concurrent.atomic.AtomicInteger;
import org.reactivestreams.*;
import io.reactivex.rxjava3.core.*;
import io.reactivex.rxjava3.exceptions.*;
import io.reactivex.rxjava3.functions.*;
import io.reactivex.rxjava3.internal.operators.flowable.FlowableConcatMap.*;
import io.reactivex.rxjava3.internal.subscriptions.SubscriptionHelper;
import io.reactivex.rxjava3.internal.util.*;
import io.reactivex.rxjava3.operators.QueueSubscription;
import io.reactivex.rxjava3.operators.SimpleQueue;
import io.reactivex.rxjava3.operators.SpscArrayQueue;
public final class FlowableConcatMapScheduler extends AbstractFlowableWithUpstream {
final Function> mapper;
final int prefetch;
final ErrorMode errorMode;
final Scheduler scheduler;
public FlowableConcatMapScheduler(Flowable source,
Function> mapper,
int prefetch, ErrorMode errorMode, Scheduler scheduler) {
super(source);
this.mapper = mapper;
this.prefetch = prefetch;
this.errorMode = errorMode;
this.scheduler = scheduler;
}
@Override
protected void subscribeActual(Subscriber s) {
switch (errorMode) {
case BOUNDARY:
source.subscribe(new ConcatMapDelayed<>(s, mapper, prefetch, false, scheduler.createWorker()));
break;
case END:
source.subscribe(new ConcatMapDelayed<>(s, mapper, prefetch, true, scheduler.createWorker()));
break;
default:
source.subscribe(new ConcatMapImmediate<>(s, mapper, prefetch, scheduler.createWorker()));
}
}
abstract static class BaseConcatMapSubscriber
extends AtomicInteger
implements FlowableSubscriber, ConcatMapSupport, Subscription, Runnable {
private static final long serialVersionUID = -3511336836796789179L;
final ConcatMapInner inner;
final Function> mapper;
final int prefetch;
final int limit;
final Scheduler.Worker worker;
Subscription upstream;
int consumed;
SimpleQueue queue;
volatile boolean done;
volatile boolean cancelled;
final AtomicThrowable errors;
volatile boolean active;
int sourceMode;
BaseConcatMapSubscriber(
Function> mapper,
int prefetch, Scheduler.Worker worker) {
this.mapper = mapper;
this.prefetch = prefetch;
this.limit = prefetch - (prefetch >> 2);
this.inner = new ConcatMapInner<>(this);
this.errors = new AtomicThrowable();
this.worker = worker;
}
@Override
public final void onSubscribe(Subscription s) {
if (SubscriptionHelper.validate(this.upstream, s)) {
this.upstream = s;
if (s instanceof QueueSubscription) {
@SuppressWarnings("unchecked") QueueSubscription f = (QueueSubscription)s;
int m = f.requestFusion(QueueSubscription.ANY | QueueSubscription.BOUNDARY);
if (m == QueueSubscription.SYNC) {
sourceMode = m;
queue = f;
done = true;
subscribeActual();
schedule();
return;
}
if (m == QueueSubscription.ASYNC) {
sourceMode = m;
queue = f;
subscribeActual();
s.request(prefetch);
return;
}
}
queue = new SpscArrayQueue<>(prefetch);
subscribeActual();
s.request(prefetch);
}
}
abstract void schedule();
abstract void subscribeActual();
@Override
public final void onNext(T t) {
if (sourceMode != QueueSubscription.ASYNC) {
if (!queue.offer(t)) {
upstream.cancel();
onError(new QueueOverflowException());
return;
}
}
schedule();
}
@Override
public final void onComplete() {
done = true;
schedule();
}
@Override
public final void innerComplete() {
active = false;
schedule();
}
}
static final class ConcatMapImmediate
extends BaseConcatMapSubscriber {
private static final long serialVersionUID = 7898995095634264146L;
final Subscriber downstream;
final AtomicInteger wip;
ConcatMapImmediate(Subscriber actual,
Function> mapper,
int prefetch, Scheduler.Worker worker) {
super(mapper, prefetch, worker);
this.downstream = actual;
this.wip = new AtomicInteger();
}
@Override
void subscribeActual() {
downstream.onSubscribe(this);
}
@Override
public void onError(Throwable t) {
if (errors.tryAddThrowableOrReport(t)) {
inner.cancel();
if (getAndIncrement() == 0) {
errors.tryTerminateConsumer(downstream);
worker.dispose();
}
}
}
boolean tryEnter() {
return get() == 0 && compareAndSet(0, 1);
}
@Override
public void innerNext(R value) {
if (tryEnter()) {
downstream.onNext(value);
if (compareAndSet(1, 0)) {
return;
}
errors.tryTerminateConsumer(downstream);
worker.dispose();
}
}
@Override
public void innerError(Throwable e) {
if (errors.tryAddThrowableOrReport(e)) {
upstream.cancel();
if (getAndIncrement() == 0) {
errors.tryTerminateConsumer(downstream);
worker.dispose();
}
}
}
@Override
public void request(long n) {
inner.request(n);
}
@Override
public void cancel() {
if (!cancelled) {
cancelled = true;
inner.cancel();
upstream.cancel();
worker.dispose();
errors.tryTerminateAndReport();
}
}
@Override
void schedule() {
if (wip.getAndIncrement() == 0) {
worker.schedule(this);
}
}
@Override
public void run() {
for (;;) {
if (cancelled) {
return;
}
if (!active) {
boolean d = done;
T v;
try {
v = queue.poll();
} catch (Throwable e) {
Exceptions.throwIfFatal(e);
upstream.cancel();
errors.tryAddThrowableOrReport(e);
errors.tryTerminateConsumer(downstream);
worker.dispose();
return;
}
boolean empty = v == null;
if (d && empty) {
downstream.onComplete();
worker.dispose();
return;
}
if (!empty) {
Publisher p;
try {
p = Objects.requireNonNull(mapper.apply(v), "The mapper returned a null Publisher");
} catch (Throwable e) {
Exceptions.throwIfFatal(e);
upstream.cancel();
errors.tryAddThrowableOrReport(e);
errors.tryTerminateConsumer(downstream);
worker.dispose();
return;
}
if (sourceMode != QueueSubscription.SYNC) {
int c = consumed + 1;
if (c == limit) {
consumed = 0;
upstream.request(c);
} else {
consumed = c;
}
}
if (p instanceof Supplier) {
@SuppressWarnings("unchecked")
Supplier supplier = (Supplier) p;
R vr;
try {
vr = supplier.get();
} catch (Throwable e) {
Exceptions.throwIfFatal(e);
upstream.cancel();
errors.tryAddThrowableOrReport(e);
errors.tryTerminateConsumer(downstream);
worker.dispose();
return;
}
if (vr == null || cancelled) {
continue;
}
if (inner.isUnbounded()) {
if (tryEnter()) {
downstream.onNext(vr);
if (!compareAndSet(1, 0)) {
errors.tryTerminateConsumer(downstream);
worker.dispose();
return;
}
}
continue;
} else {
active = true;
inner.setSubscription(new SimpleScalarSubscription<>(vr, inner));
}
} else {
active = true;
p.subscribe(inner);
}
}
}
if (wip.decrementAndGet() == 0) {
break;
}
}
}
}
static final class ConcatMapDelayed
extends BaseConcatMapSubscriber {
private static final long serialVersionUID = -2945777694260521066L;
final Subscriber downstream;
final boolean veryEnd;
ConcatMapDelayed(Subscriber actual,
Function> mapper,
int prefetch, boolean veryEnd, Scheduler.Worker worker) {
super(mapper, prefetch, worker);
this.downstream = actual;
this.veryEnd = veryEnd;
}
@Override
void subscribeActual() {
downstream.onSubscribe(this);
}
@Override
public void onError(Throwable t) {
if (errors.tryAddThrowableOrReport(t)) {
done = true;
schedule();
}
}
@Override
public void innerNext(R value) {
downstream.onNext(value);
}
@Override
public void innerError(Throwable e) {
if (errors.tryAddThrowableOrReport(e)) {
if (!veryEnd) {
upstream.cancel();
done = true;
}
active = false;
schedule();
}
}
@Override
public void request(long n) {
inner.request(n);
}
@Override
public void cancel() {
if (!cancelled) {
cancelled = true;
inner.cancel();
upstream.cancel();
worker.dispose();
errors.tryTerminateAndReport();
}
}
@Override
void schedule() {
if (getAndIncrement() == 0) {
worker.schedule(this);
}
}
@Override
public void run() {
for (;;) {
if (cancelled) {
return;
}
if (!active) {
boolean d = done;
if (d && !veryEnd) {
Throwable ex = errors.get();
if (ex != null) {
errors.tryTerminateConsumer(downstream);
worker.dispose();
return;
}
}
T v;
try {
v = queue.poll();
} catch (Throwable e) {
Exceptions.throwIfFatal(e);
upstream.cancel();
errors.tryAddThrowableOrReport(e);
errors.tryTerminateConsumer(downstream);
worker.dispose();
return;
}
boolean empty = v == null;
if (d && empty) {
errors.tryTerminateConsumer(downstream);
worker.dispose();
return;
}
if (!empty) {
Publisher p;
try {
p = Objects.requireNonNull(mapper.apply(v), "The mapper returned a null Publisher");
} catch (Throwable e) {
Exceptions.throwIfFatal(e);
upstream.cancel();
errors.tryAddThrowableOrReport(e);
errors.tryTerminateConsumer(downstream);
worker.dispose();
return;
}
if (sourceMode != QueueSubscription.SYNC) {
int c = consumed + 1;
if (c == limit) {
consumed = 0;
upstream.request(c);
} else {
consumed = c;
}
}
if (p instanceof Supplier) {
@SuppressWarnings("unchecked")
Supplier supplier = (Supplier) p;
R vr;
try {
vr = supplier.get();
} catch (Throwable e) {
Exceptions.throwIfFatal(e);
errors.tryAddThrowableOrReport(e);
if (!veryEnd) {
upstream.cancel();
errors.tryTerminateConsumer(downstream);
worker.dispose();
return;
}
vr = null;
}
if (vr == null || cancelled) {
continue;
}
if (inner.isUnbounded()) {
downstream.onNext(vr);
continue;
} else {
active = true;
inner.setSubscription(new SimpleScalarSubscription<>(vr, inner));
}
} else {
active = true;
p.subscribe(inner);
}
}
}
if (decrementAndGet() == 0) {
break;
}
}
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy