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

hu.akarnokd.asyncenum.AsyncReduceWith Maven / Gradle / Ivy

The newest version!
/*
 * Copyright 2017 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.asyncenum;

import java.util.concurrent.*;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.function.*;

final class AsyncReduceWith implements AsyncEnumerable {

    final AsyncEnumerable source;

    final Supplier initialSupplier;

    final BiFunction reducer;

    AsyncReduceWith(AsyncEnumerable source, Supplier initialSupplier, BiFunction reducer) {
        this.source = source;
        this.initialSupplier = initialSupplier;
        this.reducer = reducer;
    }

    @Override
    public AsyncEnumerator enumerator() {
        return new ReduceWithEnumerator<>(source.enumerator(), reducer, initialSupplier.get());
    }

    static final class ReduceWithEnumerator
            extends AtomicInteger
            implements AsyncEnumerator, BiConsumer {

        final AsyncEnumerator source;

        final BiFunction reducer;

        R accumulator;

        R result;

        boolean once;

        CompletableFuture completable;

        volatile boolean cancelled;

        ReduceWithEnumerator(AsyncEnumerator source, BiFunction reducer, R accumulator) {
            this.source = source;
            this.reducer = reducer;
            this.accumulator = accumulator;
        }

        @Override
        public CompletionStage moveNext() {
            if (once) {
                result = null;
                return FALSE;
            }
            once = true;
            CompletableFuture cf = new CompletableFuture<>();
            completable = cf;
            nextSource();
            return cf;
        }

        void nextSource() {
            if (getAndIncrement() == 0) {
                do {
                    if (cancelled) {
                        return;
                    }
                    source.moveNext().whenComplete(this);
                } while (decrementAndGet() != 0);
            }
        }

        @Override
        public R current() {
            return result;
        }

        @Override
        public void cancel() {
            cancelled = true;
            source.cancel();
        }

        @Override
        public void accept(Boolean aBoolean, Throwable throwable) {
            if (throwable != null) {
                accumulator = null;
                completable.completeExceptionally(throwable);
                return;
            }

            if (aBoolean) {
                accumulator = reducer.apply(accumulator, source.current());
                nextSource();
            } else {
                result = accumulator;
                accumulator = null;
                completable.complete(true);
            }
        }
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy