Skip to content

Support multiple calls to iterator() on the Iterable returned from doTransformStuf #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
gravelld wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Support multiple calls to iterator() on the Iterable returned from doTransformStuf #3

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions src/main/java/com/mathieubolla/guava/ParallelUtils.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -44,14 +44,14 @@ public static <T> Iterable<T> parallelFilter(Iterable<T> source, Predicate<T> pr
return doFilterStuf(source, predicate, factor, executorService, true);
}

private static <T, U> Iterable<U> doTransformStuf(final Iterable<T> source, final Function<T, U> transform, int factor, final ExecutorService executorService, final boolean shutdownInTheEnd) {
private static <T, U> Iterable<U> doTransformStuf(final Iterable<T> source, final Function<T, U> transform, final int factor, final ExecutorService executorService, final boolean shutdownInTheEnd) {
Preconditions.checkArgument(factor > 0, "You should really be using strictly positive factors when doing parallel computing");

final LinkedBlockingQueue<FutureTask<U>> queue = new LinkedBlockingQueue<FutureTask<U>>(factor);
final Iterator<T> sourceIterator = source.iterator();

return new Iterable<U>() {
public Iterator<U> iterator() {
final LinkedBlockingQueue<FutureTask<U>> queue = new LinkedBlockingQueue<FutureTask<U>>(factor);
final Iterator<T> sourceIterator = source.iterator();

return new AbstractIterator<U>() {
@Override
protected U computeNext() {
Expand Down