plantuml/src/net/sourceforge/plantuml/svek/FrontierCalculator.java

170 lines
4.6 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.svek;
import java.util.Collection;
import net.sourceforge.plantuml.abel.EntityPosition;
import net.sourceforge.plantuml.klimt.geom.Rankdir;
import net.sourceforge.plantuml.klimt.geom.RectangleArea;
import net.sourceforge.plantuml.klimt.geom.XPoint2D;
public class FrontierCalculator {
private static final double DELTA = 3 * EntityPosition.RADIUS;
private RectangleArea core;
private final RectangleArea initial;
public FrontierCalculator(RectangleArea initial, Collection<RectangleArea> insides, Collection<XPoint2D> points,
Rankdir rankdir) {
this.initial = initial;
for (RectangleArea in : insides)
if (core == null)
core = in;
else
core = core.merge(in);
if (core == null) {
final XPoint2D center = initial.getPointCenter();
core = new RectangleArea(center.getX() - 1, center.getY() - 1, center.getX() + 1, center.getY() + 1);
}
for (XPoint2D p : points)
core = core.merge(p);
boolean touchMinX = false;
boolean touchMaxX = false;
boolean touchMinY = false;
boolean touchMaxY = false;
for (XPoint2D p : points) {
if (p.getX() == core.getMinX())
touchMinX = true;
if (p.getX() == core.getMaxX())
touchMaxX = true;
if (p.getY() == core.getMinY())
touchMinY = true;
if (p.getY() == core.getMaxY())
touchMaxY = true;
}
if (touchMinX == false)
core = core.withMinX(initial.getMinX());
if (touchMaxX == false)
core = core.withMaxX(initial.getMaxX());
if (touchMinY == false)
core = core.withMinY(initial.getMinY());
if (touchMaxY == false)
core = core.withMaxY(initial.getMaxY());
boolean pushMinX = false;
boolean pushMaxX = false;
boolean pushMinY = false;
boolean pushMaxY = false;
for (XPoint2D p : points) {
if (p.getY() == core.getMinY() || p.getY() == core.getMaxY()) {
if (Math.abs(p.getX() - core.getMaxX()) < DELTA)
pushMaxX = true;
if (Math.abs(p.getX() - core.getMinX()) < DELTA)
pushMinX = true;
}
if (p.getX() == core.getMinX() || p.getX() == core.getMaxX()) {
if (Math.abs(p.getY() - core.getMaxY()) < DELTA)
pushMaxY = true;
if (Math.abs(p.getY() - core.getMinY()) < DELTA)
pushMinY = true;
}
}
for (XPoint2D p : points) {
if (rankdir == Rankdir.LEFT_TO_RIGHT) {
if (p.getX() == core.getMinX() && (p.getY() == core.getMinY() || p.getY() == core.getMaxY()))
pushMinX = false;
if (p.getX() == core.getMaxX() && (p.getY() == core.getMinY() || p.getY() == core.getMaxY()))
pushMaxX = false;
} else {
if (p.getY() == core.getMinY() && (p.getX() == core.getMinX() || p.getX() == core.getMaxX()))
pushMinY = false;
if (p.getY() == core.getMaxY() && (p.getX() == core.getMinX() || p.getX() == core.getMaxX()))
pushMaxY = false;
}
}
if (pushMaxX)
core = core.addMaxX(DELTA);
if (pushMinX)
core = core.addMinX(-DELTA);
if (pushMaxY)
core = core.addMaxY(DELTA);
if (pushMinY)
core = core.addMinY(-DELTA);
}
public RectangleArea getSuggestedPosition() {
return core;
}
public void ensureMinWidth(double minWidth) {
final double delta = core.getMaxX() - core.getMinX() - minWidth;
if (delta < 0) {
double newMinX = core.getMinX() + delta / 2;
double newMaxX = core.getMaxX() - delta / 2;
final double error = newMinX - initial.getMinX();
if (error < 0) {
newMinX -= error;
newMaxX -= error;
}
core = core.withMinX(newMinX);
core = core.withMaxX(newMaxX);
}
}
}