@Override public boolean preVisit(Operator<?> visitable) { if(visitable instanceof GenericDataSourceBase) { sources.add((GenericDataSourceBase<?, ?>) visitable); } else if(visitable instanceof BulkIterationBase) { ((BulkIterationBase<?>) visitable).getNextPartialSolution().accept(this); } return true; }
throw new InvalidProgramException("The iteration " + iteration.getName() + " has no input (initial partial solution)."); if (iteration.getNextPartialSolution() == null) { throw new InvalidProgramException("The iteration " + iteration.getName() + " has no next partial solution defined (is not closed)."); iteration.getNextPartialSolution().accept(dynCollector); if (iteration.getTerminationCriterion() != null) { iteration.getTerminationCriterion().accept(dynCollector); currentResult = (List<T>) execute(iteration.getNextPartialSolution(), superstep);
@Override public boolean preVisit(Operator<?> visitable) { if (this.seen.add(visitable)) { // add to the map final String name = visitable.getName(); List<Operator<?>> list = this.map.get(name); if (list == null) { list = new ArrayList<Operator<?>>(2); this.map.put(name, list); } list.add(visitable); // recurse into bulk iterations if (visitable instanceof BulkIterationBase) { ((BulkIterationBase) visitable).getNextPartialSolution().accept(this); } else if (visitable instanceof DeltaIterationBase) { ((DeltaIterationBase) visitable).getSolutionSetDelta().accept(this); ((DeltaIterationBase) visitable).getNextWorkset().accept(this); } return true; } else { return false; } }
iter.getNextPartialSolution().accept(recursiveCreator); OptimizerNode rootOfStepFunction = recursiveCreator.con2node.get(iter.getNextPartialSolution()); if (partialSolution == null) { throw new CompilerException("Error: The step functions result does not depend on the partial solution.");
throw new InvalidProgramException("The iteration " + iteration.getName() + " has no input (initial partial solution)."); if (iteration.getNextPartialSolution() == null) { throw new InvalidProgramException("The iteration " + iteration.getName() + " has no next partial solution defined (is not closed)."); iteration.getNextPartialSolution().accept(dynCollector); if (iteration.getTerminationCriterion() != null) { iteration.getTerminationCriterion().accept(dynCollector); currentResult = (List<T>) execute(iteration.getNextPartialSolution(), superstep);
throw new InvalidProgramException("The iteration " + iteration.getName() + " has no input (initial partial solution)."); if (iteration.getNextPartialSolution() == null) { throw new InvalidProgramException("The iteration " + iteration.getName() + " has no next partial solution defined (is not closed)."); iteration.getNextPartialSolution().accept(dynCollector); if (iteration.getTerminationCriterion() != null) { iteration.getTerminationCriterion().accept(dynCollector); currentResult = (List<T>) execute(iteration.getNextPartialSolution(), superstep);
iter.getNextPartialSolution().accept(recursiveCreator); OptimizerNode rootOfStepFunction = recursiveCreator.con2node.get(iter.getNextPartialSolution()); if (partialSolution == null) { throw new CompilerException("Error: The step functions result does not depend on the partial solution.");
iter.getNextPartialSolution().accept(recursiveCreator); OptimizerNode rootOfStepFunction = recursiveCreator.con2node.get(iter.getNextPartialSolution()); if (partialSolution == null) { throw new CompilerException("Error: The step functions result does not depend on the partial solution.");
iter.getNextPartialSolution().accept(recursiveCreator); OptimizerNode rootOfStepFunction = recursiveCreator.con2node.get(iter.getNextPartialSolution()); if (partialSolution == null) { throw new CompilerException("Error: The step functions result does not depend on the partial solution.");
iter.getNextPartialSolution().accept(recursiveCreator); OptimizerNode rootOfStepFunction = recursiveCreator.con2node.get(iter.getNextPartialSolution()); if (partialSolution == null) { throw new CompilerException("Error: The step functions result does not depend on the partial solution.");