mirror of https://github.com/octoleo/plantuml.git
77 lines
1.9 KiB
Java
77 lines
1.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.klimt.geom;
|
|
|
|
import java.util.Objects;
|
|
|
|
public class MinFinder {
|
|
|
|
private double minX = Double.MAX_VALUE;
|
|
private double minY = Double.MAX_VALUE;
|
|
|
|
public void manage(double x, double y) {
|
|
if (x < minX) {
|
|
minX = x;
|
|
}
|
|
if (y < minY) {
|
|
minY = y;
|
|
}
|
|
}
|
|
|
|
public void manage(XPoint2D p) {
|
|
Objects.requireNonNull(p);
|
|
manage(p.getX(), p.getY());
|
|
}
|
|
|
|
public void manage(MinFinder other) {
|
|
manage(other.minX, other.minY);
|
|
}
|
|
|
|
@Override
|
|
public String toString() {
|
|
return "minX=" + minX + " minY=" + minY;
|
|
}
|
|
|
|
public double getMinX() {
|
|
return minX;
|
|
}
|
|
|
|
public double getMinY() {
|
|
return minY;
|
|
}
|
|
|
|
}
|