plantuml/src/net/sourceforge/plantuml/ugraphic/MinMax.java

158 lines
4.2 KiB
Java

/* ========================================================================
* PlantUML : a free UML diagram generator
* ========================================================================
*
* (C) Copyright 2009-2017, 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.ugraphic;
import java.awt.geom.Dimension2D;
import java.awt.geom.Point2D;
import net.sourceforge.plantuml.Dimension2DDouble;
import net.sourceforge.plantuml.graphic.HtmlColor;
import net.sourceforge.plantuml.graphic.HtmlColorUtils;
public class MinMax {
private final double maxX;
private final double maxY;
private final double minX;
private final double minY;
public boolean doesHorizontalCross(Point2D.Double pt1, Point2D.Double pt2) {
if (pt1.getY() != pt2.getY()) {
throw new IllegalArgumentException();
}
if (pt1.getX() == pt2.getX()) {
throw new IllegalArgumentException();
}
final double y = pt1.getY();
if (y < minY || y > maxY) {
return false;
}
if (pt1.getX() < minX && pt2.getX() > maxX) {
return true;
}
if (pt2.getX() < minX && pt1.getX() > maxX) {
return true;
}
return false;
}
public static MinMax getEmpty(boolean initToZero) {
if (initToZero) {
return new MinMax(0, 0, 0, 0);
}
return new MinMax(Double.MAX_VALUE, Double.MAX_VALUE, -Double.MAX_VALUE, -Double.MAX_VALUE);
}
@Override
public String toString() {
return "(" + minX + "," + minY + ")->(" + maxX + "," + maxY + ")";
}
public static MinMax fromMutable(MinMaxMutable minmax) {
return new MinMax(minmax.getMinX(), minmax.getMinY(), minmax.getMaxX(), minmax.getMaxY());
}
private MinMax(double minX, double minY, double maxX, double maxY) {
this.minX = minX;
this.minY = minY;
this.maxX = maxX;
this.maxY = maxY;
}
public MinMax addPoint(Point2D pt) {
return addPoint(pt.getX(), pt.getY());
}
public MinMax addPoint(double x, double y) {
return new MinMax(Math.min(x, minX), Math.min(y, minY), Math.max(x, maxX), Math.max(y, maxY));
}
public MinMax addMinMax(MinMax other) {
return new MinMax(Math.min(other.minX, minX), Math.min(other.minY, minY), Math.max(other.maxX, maxX), Math.max(
other.maxY, maxY));
}
public static MinMax fromMax(double maxX, double maxY) {
return MinMax.getEmpty(true).addPoint(maxX, maxY);
}
public static MinMax fromDim(Dimension2D dim) {
return fromMax(dim.getWidth(), dim.getHeight());
}
public final double getMaxX() {
return maxX;
}
public final double getMaxY() {
return maxY;
}
public final double getMinX() {
return minX;
}
public final double getMinY() {
return minY;
}
public double getHeight() {
return maxY - minY;
}
public double getWidth() {
return maxX - minX;
}
public Dimension2D getDimension() {
return new Dimension2DDouble(maxX - minX, maxY - minY);
}
public void drawGrey(UGraphic ug) {
final HtmlColor color = HtmlColorUtils.GRAY;
ug = ug.apply(new UChangeColor(color)).apply(new UChangeBackColor(color));
ug = ug.apply(new UTranslate(minX, minY));
ug.draw(new URectangle(getWidth(), getHeight()));
}
public MinMax translate(UTranslate translate) {
final double dx = translate.getDx();
final double dy = translate.getDy();
return new MinMax(minX + dx, minY + dy, maxX + dx, maxY + dy);
}
}