mirror of https://github.com/octoleo/plantuml.git
94 lines
2.7 KiB
Java
94 lines
2.7 KiB
Java
/* ========================================================================
|
|
* PlantUML : a free UML diagram generator
|
|
* ========================================================================
|
|
*
|
|
* (C) Copyright 2009-2023, Arnaud Roques
|
|
*
|
|
* Project Info: http://plantuml.com
|
|
*
|
|
* If you like this project or if you find it useful, you can support us at:
|
|
*
|
|
* http://plantuml.com/patreon (only 1$ per month!)
|
|
* http://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 java.util.Iterator;
|
|
import java.util.LinkedHashMap;
|
|
import java.util.Map;
|
|
import java.util.Map.Entry;
|
|
|
|
import net.sourceforge.plantuml.project.Load;
|
|
import net.sourceforge.plantuml.project.Value;
|
|
import net.sourceforge.plantuml.project.core.TaskAttribute;
|
|
import net.sourceforge.plantuml.project.time.Day;
|
|
|
|
public abstract class AbstractSolver implements Solver {
|
|
|
|
protected final Map<TaskAttribute, Value> values = new LinkedHashMap<TaskAttribute, Value>();
|
|
|
|
final public void setData(TaskAttribute attribute, Value value) {
|
|
final Value previous = values.remove(attribute);
|
|
if (previous != null && attribute == TaskAttribute.START) {
|
|
final Day previousInstant = (Day) previous;
|
|
if (previousInstant.compareTo((Day) value) > 0)
|
|
value = previous;
|
|
|
|
}
|
|
values.put(attribute, value);
|
|
if (values.size() > 2)
|
|
removeFirstElement();
|
|
|
|
assert values.size() <= 2;
|
|
|
|
}
|
|
|
|
private void removeFirstElement() {
|
|
final Iterator<Entry<TaskAttribute, Value>> it = values.entrySet().iterator();
|
|
it.next();
|
|
it.remove();
|
|
}
|
|
|
|
final public Value getData(TaskAttribute attribute) {
|
|
Value result = values.get(attribute);
|
|
if (result == null) {
|
|
if (attribute == TaskAttribute.END)
|
|
return computeEnd();
|
|
|
|
if (attribute == TaskAttribute.START)
|
|
return computeStart();
|
|
|
|
return Load.inWinks(1);
|
|
// throw new UnsupportedOperationException(attribute.toString());
|
|
}
|
|
return result;
|
|
}
|
|
|
|
abstract protected Value computeEnd();
|
|
|
|
abstract protected Value computeStart();
|
|
|
|
}
|