mirror of https://github.com/octoleo/plantuml.git
126 lines
3.4 KiB
Java
126 lines
3.4 KiB
Java
/* ========================================================================
|
|
* PlantUML : a free UML diagram generator
|
|
* ========================================================================
|
|
*
|
|
* (C) Copyright 2009-2020, 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.sequencediagram.teoz;
|
|
|
|
import java.util.ArrayList;
|
|
import java.util.Collections;
|
|
import java.util.HashMap;
|
|
import java.util.List;
|
|
import java.util.Map;
|
|
|
|
import net.sourceforge.plantuml.graphic.SymbolContext;
|
|
|
|
public class Stairs2 {
|
|
|
|
private final List<StairsPosition> ys = new ArrayList<StairsPosition>();
|
|
private final List<IntegerColored> values = new ArrayList<IntegerColored>();
|
|
private final Map<Double, IntegerColored> cache = new HashMap<Double, IntegerColored>();
|
|
|
|
@Override
|
|
public String toString() {
|
|
return ys.toString() + " " + values;
|
|
}
|
|
|
|
public void addStep(StairsPosition position, int value, SymbolContext color) {
|
|
if (value < 0) {
|
|
throw new IllegalArgumentException();
|
|
}
|
|
// System.err.println("Stairs2::addStep " + position + " " + value + " color=" +
|
|
// color);
|
|
assert ys.size() == values.size();
|
|
if (ys.size() > 0) {
|
|
final double lastY = ys.get(ys.size() - 1).getValue();
|
|
if (position.getValue() <= lastY) {
|
|
// throw new IllegalArgumentException();
|
|
return;
|
|
}
|
|
if (lastY == position.getValue()) {
|
|
values.set(ys.size() - 1, new IntegerColored(value, color));
|
|
cache.clear();
|
|
return;
|
|
}
|
|
}
|
|
ys.add(position);
|
|
values.add(new IntegerColored(value, color));
|
|
cache.clear();
|
|
}
|
|
|
|
public int getMaxValue() {
|
|
int max = Integer.MIN_VALUE;
|
|
for (IntegerColored vc : values) {
|
|
final int v = vc.getValue();
|
|
if (v > max) {
|
|
max = v;
|
|
}
|
|
}
|
|
return max;
|
|
}
|
|
|
|
public List<StairsPosition> getYs() {
|
|
return Collections.unmodifiableList(ys);
|
|
}
|
|
|
|
public IntegerColored getValue(double y) {
|
|
IntegerColored resultc = cache.get(y);
|
|
if (resultc == null) {
|
|
resultc = getValueSlow(new StairsPosition(y, false));
|
|
cache.put(y, resultc);
|
|
}
|
|
return resultc;
|
|
}
|
|
|
|
private IntegerColored getValueSlow(StairsPosition y) {
|
|
final int idx = Collections.binarySearch(ys, y);
|
|
if (idx >= 0) {
|
|
return values.get(idx);
|
|
}
|
|
final int insertPoint = -idx - 1;
|
|
if (insertPoint == 0) {
|
|
return new IntegerColored(0, null);
|
|
}
|
|
return values.get(insertPoint - 1);
|
|
}
|
|
|
|
public int getLastValue() {
|
|
final int size = values.size();
|
|
if (size == 0) {
|
|
return 0;
|
|
}
|
|
return values.get(size - 1).getValue();
|
|
}
|
|
|
|
}
|