/*
 * Copyright (C) 2010 TranceCode Software
 *
 * This library is free software; you can redistribute it and/or modify it under
 * the terms of the GNU Lesser General Public License as published by the Free
 * Software Foundation; either version 2.1 of the License, or (at your option)
 * any later version.
 * 
 * This library is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
 * details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with this library; if not, write to the Free Software Foundation, Inc.,
 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 
 */
package org.trancecode.concurrent;

import com.google.common.base.Function;
import com.google.common.base.Predicate;
import com.google.common.base.Predicates;
import com.google.common.collect.Iterables;

import java.util.concurrent.Callable;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Future;

/**
 * Utility methods related to {@link Future}.
 * 
 * @author Herve Quiroz
 */
public final class TcFutures
{
    public static <T> Iterable<Future<T>> cancelled(final Iterable<Future<T>> tasks)
    {
        final Predicate<Future<T>> filter = FuturePredicates.isCancelled();
        return Iterables.filter(tasks, filter);
    }

    public static <T> Iterable<Future<T>> done(final Iterable<Future<T>> tasks)
    {
        final Predicate<Future<T>> filter = FuturePredicates.isDone();
        return Iterables.filter(tasks, filter);
    }

    public static <T> Iterable<Future<T>> notDone(final Iterable<Future<T>> tasks)
    {
        final Predicate<Future<T>> filter = FuturePredicates.isDone();
        return Iterables.filter(tasks, Predicates.not(filter));
    }

    public static <T> void cancel(final Iterable<Future<T>> tasks)
    {
        for (final Future<T> future : notDone(tasks))
        {
            future.cancel(true);
        }
    }

    public static <T> Iterable<Future<T>> submit(final ExecutorService executor, final Iterable<Callable<T>> tasks)
    {
        final Function<Callable<T>, Future<T>> submitFunction = CallableFunctions.submit(executor);
        return Iterables.transform(tasks, submitFunction);
    }

    public static <T> Iterable<Future<T>> submit(final TaskExecutor executor, final Iterable<Callable<T>> tasks)
    {
        final Function<Callable<T>, Future<T>> submitFunction = CallableFunctions.submit(executor);
        return Iterables.transform(tasks, submitFunction);
    }

    public static <T> Iterable<T> get(final Iterable<Future<T>> futures)
    {
        final Function<Future<T>, T> getFunction = FutureFunctions.get();
        return Iterables.transform(futures, getFunction);
    }

    private TcFutures()
    {
        // No instantiation
    }
}

@@ -1023,16 +1023,64 @@
 llable;%0A
+import java.util.concurrent.ExecutionException;%0A
 import j
@@ -2763,17 +2763,77 @@
 futures)
+ throws ExecutionException,%0A            InterruptedException
 %0A
-
     %7B%0A  
@@ -2900,24 +2900,50 @@
 ions.get();%0A
+        try%0A        %7B%0A    
         retu
@@ -2980,32 +2980,292 @@
 , getFunction);%0A
+        %7D%0A        catch (final RuntimeInterruptedException e)%0A        %7B%0A            throw (InterruptedException) e.getCause();%0A        %7D%0A        catch (final RuntimeExecutionException e)%0A        %7B%0A            throw (ExecutionException) e.getCause();%0A        %7D%0A
     %7D%0A%0A    priva

Handle ExecutionException from Future.get() and take the opportunity to cancel future tasks when an error occurs