private void insertInMapping(int taskInSubset, int task, HNSubSet subset) {
HNSet hSet = mapping[taskInSubset][task];
if (hSet == null) {
hSet = new HNSet();
}
hSet.add(subset);
mapping[taskInSubset][task] = hSet;
}
private HNSet getAlreadyMarkedPlaces(HNSet set, int task) {
HNSet markedPlaces = null;
HNSubSet subset = null;
markedPlaces = new HNSet();
for (int iSet = 0; iSet < set.size(); iSet++) {
subset = set.get(iSet);
if (subset.contains(task)) {
markedPlaces.add(subset);
}
}
return markedPlaces;
}
private CombinationTasksToFire findBestCombination(
CombinationTasksToFire bCombination,
HNSet inputSet,
int rootTask,
CombinationTasksToFire combination,
HNSubSet treatedTasks) {
int task = -1;
HNSet alreadyMarkedPlaces = null;
HNSet temp_inputSet = null;
HNSubSet noTokensFromTasks = null;
HNSubSet subset = null;
if ((bCombination.getTasks().size() == 0)
|| (bCombination.getNumberMissingTokens() > combination.getNumberMissingTokens())) {
if (rootTask != ROOT_TASK_ID) {
alreadyMarkedPlaces = getAlreadyMarkedPlaces(inputSet, rootTask);
noTokensFromTasks = HNSet.getUnionSet(alreadyMarkedPlaces);
inputSet.removeAll(alreadyMarkedPlaces);
combination.getTasks().add(rootTask);
}
if (inputSet.size() == 0) {
bCombination = combination.copy();
} else {
// akam: I stoppe here - 10/07/2005
if (rootTask != ROOT_TASK_ID) {
temp_inputSet = new HNSet();
for (int iInputSet = 0; iInputSet < inputSet.size(); iInputSet++) {
subset = inputSet.get(iInputSet);
subset.removeAll(noTokensFromTasks);
subset.removeAll(treatedTasks);
if (subset.size() == 0) {
combination.setTokens(combination.getNumberMissingTokens() + 1);
} else {
temp_inputSet.add(subset);
}
}
inputSet = temp_inputSet;
}
for (int iInputSet = 0; iInputSet < inputSet.size(); iInputSet++) {
subset = inputSet.get(iInputSet);
while (subset.size() > 0) {
task = subset.get(generator.nextInt(subset.size()));
bCombination =
findBestCombination(
bCombination,
inputSet.deepCopy(),
task,
combination.copy(),
treatedTasks.deepCopy());
treatedTasks.add(task);
subset.remove(task);
}
}
}
}
return bCombination;
}
private CombinationTasksToFire findBestSetTasks(int element) {
CombinationTasksToFire bCombination = null;
CombinationTasksToFire combination = null;
HNSubSet noTokensFromTasks = null;
HNSubSet treatedTasks = null;
HNSet inputSet = null;
HNSet temp_inputSet = null;
HNSubSet subset = null;
int numberMissingTokens = 0;
int rootTask = ROOT_TASK_ID;
bCombination = new CombinationTasksToFire();
inputSet = hNet.getInputSet(element);
if (inputSet.size() == 0) {
if (startPlace <= 0) {
numberMissingTokens++; // one token is missing
}
} else {
// inputSubset is not empty. Search for tasks that "have tokens" to
// element
noTokensFromTasks = getTasksWithEmptyOutputPlaces(element);
// >>>>>>>>>>>>>>>>>> Hint!!! I think that's why I don't run into
// problems...
// /// Idea -> shrink the subsets without using a temp variable, get
// / the size before shrinking, shrink them, reorder the set and
// /remove the empty set (do this via a method in the class
// /HNSet, get the new size. This is the number of missing tokens.
// make a copy to avoid destroying the original net
inputSet = inputSet.deepCopy();
temp_inputSet = new HNSet();
// removing the tasks whose output subsets that contain element are
// empty
for (int iInputSubsets = 0; iInputSubsets < inputSet.size(); iInputSubsets++) {
subset = inputSet.get(iInputSubsets);
subset.removeAll(noTokensFromTasks);
if (subset.size() == 0) {
numberMissingTokens += 1;
} else {
temp_inputSet.add(subset);
}
}
inputSet = temp_inputSet;
// retrieving the best combination of tasks that can fire to enable
// element
if (inputSet.size() > 0) {
combination = new CombinationTasksToFire();
treatedTasks = new HNSubSet();
bCombination =
findBestCombination(bCombination, inputSet, rootTask, combination, treatedTasks);
}
}
bCombination.setElementToFire(element);
bCombination.setTokens(bCombination.getNumberMissingTokens() + numberMissingTokens);
return bCombination;
}