All Downloads are FREE. Search and download functionalities are using the official Maven repository.

hu.akarnokd.rxjava3.joins.ActivePlanN Maven / Gradle / Ivy

Go to download

RxJava 3.x extra sources, operators and components and ports of many 1.x companion libraries.

There is a newer version: 3.1.1
Show newest version
/*
 * Copyright 2016-2019 David Karnok
 *
 * 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 hu.akarnokd.rxjava3.joins;

import java.util.*;

import io.reactivex.rxjava3.core.Notification;
import io.reactivex.rxjava3.functions.*;

/**
 * Represents an active plan.
 */
final class ActivePlanN extends ActivePlan0 {
    private final Consumer onNext;
    private final Action onCompleted;
    private final List> observers;

    ActivePlanN(List> observers,
            Consumer onNext,
            Action onCompleted) {
        this.onNext = onNext;
        this.onCompleted = onCompleted;
        this.observers = new ArrayList>(observers);
        for (JoinObserver1 jo : this.observers) {
            addJoinObserver(jo);
        }
    }

    @Override
    protected void match() throws Throwable {
        Object[] notifications = new Object[this.observers.size()];
        int j = 0;
        int completedCount = 0;
        for (JoinObserver1 jo : this.observers) {
            if (jo.queue().isEmpty()) {
                return;
            }
            Notification n = jo.queue().peek();
            if (n.isOnComplete()) {
                completedCount++;
            }
            notifications[j] = n.getValue();
            j++;
        }

        if (completedCount == j) {
            onCompleted.run();
        } else {
            dequeue();
            onNext.accept(notifications);
        }
    }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy