mirror of
https://github.com/octoleo/plantuml.git
synced 2024-05-30 07:00:48 +00:00
8b5a1521e7
https://forum.plantuml.net/18397/gantt-how-handle-resource-starts-terminates-specific-date https://forum.plantuml.net/17571/is-it-possible-to-set-gantt-tasks-to-be-incomplete-by-default?show=17571#q17571 https://forum.plantuml.net/18128/gantt-diagram-vertical-separator-styling?show=18128#q18128
93 lines
2.9 KiB
Java
93 lines
2.9 KiB
Java
/* ========================================================================
|
|
* PlantUML : a free UML diagram generator
|
|
* ========================================================================
|
|
*
|
|
* (C) Copyright 2009-2024, Arnaud Roques
|
|
*
|
|
* Project Info: https://plantuml.com
|
|
*
|
|
* If you like this project or if you find it useful, you can support us at:
|
|
*
|
|
* https://plantuml.com/patreon (only 1$ per month!)
|
|
* https://plantuml.com/paypal
|
|
*
|
|
* This file is part of PlantUML.
|
|
*
|
|
* PlantUML is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* PlantUML 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 General Public
|
|
* License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
|
|
* USA.
|
|
*
|
|
*
|
|
* Original Author: Arnaud Roques
|
|
*
|
|
*
|
|
*/
|
|
package net.sourceforge.plantuml.project.solver;
|
|
|
|
import net.sourceforge.plantuml.project.Load;
|
|
import net.sourceforge.plantuml.project.LoadPlanable;
|
|
import net.sourceforge.plantuml.project.core.TaskAttribute;
|
|
import net.sourceforge.plantuml.project.time.Day;
|
|
|
|
public class SolverImpl extends AbstractSolver implements Solver {
|
|
// ::remove folder when __HAXE__
|
|
|
|
private final LoadPlanable loadPlanable;
|
|
|
|
public SolverImpl(LoadPlanable loadPlanable) {
|
|
this.loadPlanable = loadPlanable;
|
|
}
|
|
|
|
@Override
|
|
protected Day computeEnd() {
|
|
Day current = (Day) values.get(TaskAttribute.START);
|
|
int fullLoad = ((Load) values.get(TaskAttribute.LOAD)).getFullLoad();
|
|
int cpt = 0;
|
|
final Day lastDayIfAny = loadPlanable.getLastDayIfAny();
|
|
while (fullLoad > 0) {
|
|
fullLoad -= loadPlanable.getLoadAt(current);
|
|
current = current.increment();
|
|
if (lastDayIfAny != null && current.compareTo(lastDayIfAny) > 0)
|
|
throw new ImpossibleSolvingException(
|
|
"Because all resources will be off at some point, we cannot compute any end date for "
|
|
+ loadPlanable);
|
|
cpt++;
|
|
if (cpt > 100000)
|
|
throw new ImpossibleSolvingException("There is an issue in planning your tasks!");
|
|
|
|
}
|
|
return current.decrement();
|
|
}
|
|
|
|
@Override
|
|
protected Day computeStart() {
|
|
Day current = (Day) values.get(TaskAttribute.END);
|
|
int fullLoad = ((Load) values.get(TaskAttribute.LOAD)).getFullLoad();
|
|
int cpt = 0;
|
|
while (fullLoad > 0) {
|
|
fullLoad -= loadPlanable.getLoadAt(current);
|
|
current = current.decrement();
|
|
if (current.getMillis() <= 0)
|
|
return current;
|
|
|
|
cpt++;
|
|
if (cpt > 100000)
|
|
throw new ImpossibleSolvingException("There is an issue in planning your tasks!");
|
|
|
|
}
|
|
return current.increment();
|
|
}
|
|
|
|
}
|