com.gs.collections.impl.parallel.ProcedureFJTaskRunner Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of gs-collections Show documentation
Show all versions of gs-collections Show documentation
GS Collections is a collections framework for Java. It has JDK-compatible List, Set and Map
implementations with a rich API and set of utility classes that work with any JDK compatible Collections,
Arrays, Maps or Strings. The iteration protocol was inspired by the Smalltalk collection framework.
/*
* Copyright 2011 Goldman Sachs.
*
* 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 com.gs.collections.impl.parallel;
import java.util.List;
import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.Executor;
import com.gs.collections.api.block.function.Function;
import com.gs.collections.api.block.procedure.Procedure;
import com.gs.collections.impl.utility.ArrayIterate;
public final class ProcedureFJTaskRunner>
{
private final Function, BT> procedureFunction = new ProcedureExtractor();
private ProcedureFJTask[] procedures;
private Throwable error;
private final Combiner combiner;
private final int taskCount;
private final BlockingQueue outputQueue;
private final CountDownLatch latch;
public ProcedureFJTaskRunner(Combiner newCombiner, int taskCount)
{
this.combiner = newCombiner;
this.taskCount = taskCount;
if (this.combiner.useCombineOne())
{
this.outputQueue = new ArrayBlockingQueue(taskCount);
this.latch = null;
}
else
{
this.latch = new CountDownLatch(taskCount);
this.outputQueue = null;
}
}
private void createAndExecuteTasks(Executor executor, ProcedureFactory procedureFactory, List list)
{
this.procedures = new ProcedureFJTask[this.taskCount];
int sectionSize = list.size() / this.taskCount;
int size = this.taskCount;
for (int index = 0; index < size; index++)
{
ProcedureFJTask procedureFJTask = new ProcedureFJTask(this, procedureFactory, list, index, sectionSize,
index == this.taskCount - 1);
this.procedures[index] = procedureFJTask;
executor.execute(procedureFJTask);
}
}
public void setFailed(Throwable newError)
{
this.error = newError;
}
public void taskCompleted(ProcedureFJTask task)
{
if (this.combiner.useCombineOne())
{
this.outputQueue.add(task.getProcedure());
}
else
{
this.latch.countDown();
}
}
public void executeAndCombine(Executor executor, ProcedureFactory procedureFactory, List list)
{
this.createAndExecuteTasks(executor, procedureFactory, list);
this.join();
if (this.error != null)
{
throw new RuntimeException("One or more parallel tasks failed", this.error);
}
//don't combine until the lock is notified
this.combineTasks();
}
private void join()
{
try
{
if (this.combiner.useCombineOne())
{
int remaingTaskCount = this.taskCount;
while (remaingTaskCount > 0)
{
this.combiner.combineOne(this.outputQueue.take());
remaingTaskCount--;
}
}
else
{
this.latch.await();
}
}
catch (InterruptedException e)
{
throw new RuntimeException("Combine failed", e);
}
}
private void combineTasks()
{
if (!this.combiner.useCombineOne())
{
this.combiner.combineAll(ArrayIterate.collect(this.procedures, this.procedureFunction));
}
}
private final class ProcedureExtractor implements Function, BT>
{
private static final long serialVersionUID = 1L;
public BT valueOf(ProcedureFJTask object)
{
return object.getProcedure();
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy