io.reactivex.rxjava3.internal.operators.flowable.FlowableSequenceEqual 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
The newest version!
/*
* 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.concurrent.atomic.*;
import org.reactivestreams.*;
import io.reactivex.rxjava3.core.*;
import io.reactivex.rxjava3.exceptions.*;
import io.reactivex.rxjava3.functions.BiPredicate;
import io.reactivex.rxjava3.internal.subscriptions.*;
import io.reactivex.rxjava3.internal.util.AtomicThrowable;
import io.reactivex.rxjava3.operators.QueueSubscription;
import io.reactivex.rxjava3.operators.SimpleQueue;
import io.reactivex.rxjava3.operators.SpscArrayQueue;
public final class FlowableSequenceEqual extends Flowable {
final Publisher extends T> first;
final Publisher extends T> second;
final BiPredicate super T, ? super T> comparer;
final int prefetch;
public FlowableSequenceEqual(Publisher extends T> first, Publisher extends T> second,
BiPredicate super T, ? super T> comparer, int prefetch) {
this.first = first;
this.second = second;
this.comparer = comparer;
this.prefetch = prefetch;
}
@Override
public void subscribeActual(Subscriber super Boolean> s) {
EqualCoordinator parent = new EqualCoordinator<>(s, prefetch, comparer);
s.onSubscribe(parent);
parent.subscribe(first, second);
}
/**
* Provides callbacks for the EqualSubscribers.
*/
interface EqualCoordinatorHelper {
void drain();
void innerError(Throwable ex);
}
static final class EqualCoordinator extends DeferredScalarSubscription
implements EqualCoordinatorHelper {
private static final long serialVersionUID = -6178010334400373240L;
final BiPredicate super T, ? super T> comparer;
final EqualSubscriber first;
final EqualSubscriber second;
final AtomicThrowable errors;
final AtomicInteger wip;
T v1;
T v2;
EqualCoordinator(Subscriber super Boolean> actual, int prefetch, BiPredicate super T, ? super T> comparer) {
super(actual);
this.comparer = comparer;
this.wip = new AtomicInteger();
this.first = new EqualSubscriber<>(this, prefetch);
this.second = new EqualSubscriber<>(this, prefetch);
this.errors = new AtomicThrowable();
}
void subscribe(Publisher extends T> source1, Publisher extends T> source2) {
source1.subscribe(first);
source2.subscribe(second);
}
@Override
public void cancel() {
super.cancel();
first.cancel();
second.cancel();
errors.tryTerminateAndReport();
if (wip.getAndIncrement() == 0) {
first.clear();
second.clear();
}
}
void cancelAndClear() {
first.cancel();
first.clear();
second.cancel();
second.clear();
}
@Override
public void drain() {
if (wip.getAndIncrement() != 0) {
return;
}
int missed = 1;
for (;;) {
SimpleQueue q1 = first.queue;
SimpleQueue q2 = second.queue;
if (q1 != null && q2 != null) {
for (;;) {
if (isCancelled()) {
first.clear();
second.clear();
return;
}
Throwable ex = errors.get();
if (ex != null) {
cancelAndClear();
errors.tryTerminateConsumer(downstream);
return;
}
boolean d1 = first.done;
T a = v1;
if (a == null) {
try {
a = q1.poll();
} catch (Throwable exc) {
Exceptions.throwIfFatal(exc);
cancelAndClear();
errors.tryAddThrowableOrReport(exc);
errors.tryTerminateConsumer(downstream);
return;
}
v1 = a;
}
boolean e1 = a == null;
boolean d2 = second.done;
T b = v2;
if (b == null) {
try {
b = q2.poll();
} catch (Throwable exc) {
Exceptions.throwIfFatal(exc);
cancelAndClear();
errors.tryAddThrowableOrReport(exc);
errors.tryTerminateConsumer(downstream);
return;
}
v2 = b;
}
boolean e2 = b == null;
if (d1 && d2 && e1 && e2) {
complete(true);
return;
}
if ((d1 && d2) && (e1 != e2)) {
cancelAndClear();
complete(false);
return;
}
if (e1 || e2) {
break;
}
boolean c;
try {
c = comparer.test(a, b);
} catch (Throwable exc) {
Exceptions.throwIfFatal(exc);
cancelAndClear();
errors.tryAddThrowableOrReport(exc);
errors.tryTerminateConsumer(downstream);
return;
}
if (!c) {
cancelAndClear();
complete(false);
return;
}
v1 = null;
v2 = null;
first.request();
second.request();
}
} else {
if (isCancelled()) {
first.clear();
second.clear();
return;
}
Throwable ex = errors.get();
if (ex != null) {
cancelAndClear();
errors.tryTerminateConsumer(downstream);
return;
}
}
missed = wip.addAndGet(-missed);
if (missed == 0) {
break;
}
}
}
@Override
public void innerError(Throwable t) {
if (errors.tryAddThrowableOrReport(t)) {
drain();
}
}
}
static final class EqualSubscriber
extends AtomicReference
implements FlowableSubscriber {
private static final long serialVersionUID = 4804128302091633067L;
final EqualCoordinatorHelper parent;
final int prefetch;
final int limit;
long produced;
volatile SimpleQueue queue;
volatile boolean done;
int sourceMode;
EqualSubscriber(EqualCoordinatorHelper parent, int prefetch) {
this.parent = parent;
this.limit = prefetch - (prefetch >> 2);
this.prefetch = prefetch;
}
@Override
public void onSubscribe(Subscription s) {
if (SubscriptionHelper.setOnce(this, s)) {
if (s instanceof QueueSubscription) {
@SuppressWarnings("unchecked")
QueueSubscription qs = (QueueSubscription) s;
int m = qs.requestFusion(QueueSubscription.ANY);
if (m == QueueSubscription.SYNC) {
sourceMode = m;
queue = qs;
done = true;
parent.drain();
return;
}
if (m == QueueSubscription.ASYNC) {
sourceMode = m;
queue = qs;
s.request(prefetch);
return;
}
}
queue = new SpscArrayQueue<>(prefetch);
s.request(prefetch);
}
}
@Override
public void onNext(T t) {
if (sourceMode == QueueSubscription.NONE) {
if (!queue.offer(t)) {
onError(MissingBackpressureException.createDefault());
return;
}
}
parent.drain();
}
@Override
public void onError(Throwable t) {
parent.innerError(t);
}
@Override
public void onComplete() {
done = true;
parent.drain();
}
public void request() {
if (sourceMode != QueueSubscription.SYNC) {
long p = produced + 1;
if (p >= limit) {
produced = 0;
get().request(p);
} else {
produced = p;
}
}
}
public void cancel() {
SubscriptionHelper.cancel(this);
}
void clear() {
SimpleQueue sq = queue;
if (sq != null) {
sq.clear();
}
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy