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

com.arangodb.shaded.vertx.core.CompositeFuture Maven / Gradle / Ivy

There is a newer version: 7.8.0
Show newest version
/*
 * Copyright (c) 2011-2019 Contributors to the Eclipse Foundation
 *
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License 2.0 which is available at
 * http://www.eclipse.org/legal/epl-2.0, or the Apache License, Version 2.0
 * which is available at https://www.apache.org/licenses/LICENSE-2.0.
 *
 * SPDX-License-Identifier: EPL-2.0 OR Apache-2.0
 */

package com.arangodb.shaded.vertx.core;

import com.arangodb.shaded.vertx.codegen.annotations.GenIgnore;
import com.arangodb.shaded.vertx.core.impl.future.CompositeFutureImpl;

import java.util.ArrayList;
import java.util.List;

/**
 * The composite future wraps a list of {@link Future futures}, it is useful when several futures
 * needs to be coordinated.
 * The handlers set for the coordinated futures are overridden by the handler of the composite future.
 *
 * @author Julien Viet
 */
public interface CompositeFuture extends Future {

  /**
   * Return a composite future, succeeded when all futures are succeeded, failed when any future is failed.
   * 

* The returned future fails as soon as one of {@code f1} or {@code f2} fails. * * @param f1 future * @param f2 future * @return the composite future */ static CompositeFuture all(Future f1, Future f2) { return CompositeFutureImpl.all(f1, f2); } /** * Like {@link #all(Future, Future)} but with 3 futures. */ static CompositeFuture all(Future f1, Future f2, Future f3) { return CompositeFutureImpl.all(f1, f2, f3); } /** * Like {@link #all(Future, Future)} but with 4 futures. */ static CompositeFuture all(Future f1, Future f2, Future f3, Future f4) { return CompositeFutureImpl.all(f1, f2, f3, f4); } /** * Like {@link #all(Future, Future)} but with 5 futures. */ static CompositeFuture all(Future f1, Future f2, Future f3, Future f4, Future f5) { return CompositeFutureImpl.all(f1, f2, f3, f4, f5); } /** * Like {@link #all(Future, Future)} but with 6 futures. */ static CompositeFuture all(Future f1, Future f2, Future f3, Future f4, Future f5, Future f6) { return CompositeFutureImpl.all(f1, f2, f3, f4, f5, f6); } /** * Like {@link #all(Future, Future)} but with a list of futures.

* * When the list is empty, the returned future will be already completed. */ static CompositeFuture all(List futures) { return CompositeFutureImpl.all(futures.toArray(new Future[0])); } /** * Return a composite future, succeeded when any futures is succeeded, failed when all futures are failed. *

* The returned future succeeds as soon as one of {@code f1} or {@code f2} succeeds. * * @param f1 future * @param f2 future * @return the composite future */ static CompositeFuture any(Future f1, Future f2) { return CompositeFutureImpl.any(f1, f2); } /** * Like {@link #any(Future, Future)} but with 3 futures. */ static CompositeFuture any(Future f1, Future f2, Future f3) { return CompositeFutureImpl.any(f1, f2, f3); } /** * Like {@link #any(Future, Future)} but with 4 futures. */ static CompositeFuture any(Future f1, Future f2, Future f3, Future f4) { return CompositeFutureImpl.any(f1, f2, f3, f4); } /** * Like {@link #any(Future, Future)} but with 5 futures. */ static CompositeFuture any(Future f1, Future f2, Future f3, Future f4, Future f5) { return CompositeFutureImpl.any(f1, f2, f3, f4, f5); } /** * Like {@link #any(Future, Future)} but with 6 futures. */ static CompositeFuture any(Future f1, Future f2, Future f3, Future f4, Future f5, Future f6) { return CompositeFutureImpl.any(f1, f2, f3, f4, f5, f6); } /** * Like {@link #any(Future, Future)} but with a list of futures.

* * When the list is empty, the returned future will be already completed. */ static CompositeFuture any(List futures) { return CompositeFutureImpl.any(futures.toArray(new Future[0])); } /** * Return a composite future, succeeded when all futures are succeeded, failed when any future is failed. *

* It always wait until all its futures are completed and will not fail as soon as one of {@code f1} or {@code f2} fails. * * @param f1 future * @param f2 future * @return the composite future */ static CompositeFuture join(Future f1, Future f2) { return CompositeFutureImpl.join(f1, f2); } /** * Like {@link #join(Future, Future)} but with 3 futures. */ static CompositeFuture join(Future f1, Future f2, Future f3) { return CompositeFutureImpl.join(f1, f2, f3); } /** * Like {@link #join(Future, Future)} but with 4 futures. */ static CompositeFuture join(Future f1, Future f2, Future f3, Future f4) { return CompositeFutureImpl.join(f1, f2, f3, f4); } /** * Like {@link #join(Future, Future)} but with 5 futures. */ static CompositeFuture join(Future f1, Future f2, Future f3, Future f4, Future f5) { return CompositeFutureImpl.join(f1, f2, f3, f4, f5); } /** * Like {@link #join(Future, Future)} but with 6 futures. */ static CompositeFuture join(Future f1, Future f2, Future f3, Future f4, Future f5, Future f6) { return CompositeFutureImpl.join(f1, f2, f3, f4, f5, f6); } /** * Like {@link #join(Future, Future)} but with a list of futures.

* * When the list is empty, the returned future will be already completed. */ static CompositeFuture join(List futures) { return CompositeFutureImpl.join(futures.toArray(new Future[0])); } @Override CompositeFuture onComplete(Handler> handler); @Override default CompositeFuture onSuccess(Handler handler) { Future.super.onSuccess(handler); return this; } @Override default CompositeFuture onFailure(Handler handler) { Future.super.onFailure(handler); return this; } /** * Returns a cause of a wrapped future * * @param index the wrapped future index */ Throwable cause(int index); /** * Returns true if a wrapped future is succeeded * * @param index the wrapped future index */ boolean succeeded(int index); /** * Returns true if a wrapped future is failed * * @param index the wrapped future index */ boolean failed(int index); /** * Returns true if a wrapped future is completed * * @param index the wrapped future index */ boolean isComplete(int index); /** * Returns the result of a wrapped future * * @param index the wrapped future index */ T resultAt(int index); /** * @return the number of wrapped future */ int size(); /** * @return a list of the current completed values. If one future is not yet resolved or is failed, {@code} null * will be used */ @GenIgnore default List list() { int size = size(); ArrayList list = new ArrayList<>(size); for (int index = 0;index < size;index++) { list.add(resultAt(index)); } return list; } /** * @return a list of all the eventual failure causes. If no future failed, returns a list of null values. */ @GenIgnore default List causes() { int size = size(); ArrayList list = new ArrayList<>(size); for (int index = 0; index < size; index++) { list.add(cause(index)); } return list; } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy