mirror of https://github.com/octoleo/plantuml.git
101 lines
2.4 KiB
Java
101 lines
2.4 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.comp;
|
|
|
|
public class Slot implements Comparable<Slot> {
|
|
|
|
private final double start;
|
|
private final double end;
|
|
|
|
public Slot(double start, double end) {
|
|
if (start >= end) {
|
|
throw new IllegalArgumentException();
|
|
}
|
|
this.start = start;
|
|
this.end = end;
|
|
}
|
|
|
|
@Override
|
|
public String toString() {
|
|
return "(" + start + "," + end + ")";
|
|
}
|
|
|
|
public double getStart() {
|
|
return start;
|
|
}
|
|
|
|
public double getEnd() {
|
|
return end;
|
|
}
|
|
|
|
public double size() {
|
|
return end - start;
|
|
}
|
|
|
|
public boolean contains(double v) {
|
|
return v >= start && v <= end;
|
|
}
|
|
|
|
public boolean intersect(Slot other) {
|
|
return contains(other.start) || contains(other.end) || other.contains(start) || other.contains(end);
|
|
}
|
|
|
|
public Slot merge(Slot other) {
|
|
return new Slot(Math.min(start, other.start), Math.max(end, other.end));
|
|
}
|
|
|
|
public Slot intersect(double otherStart, double otherEnd) {
|
|
if (otherStart >= end) {
|
|
return null;
|
|
}
|
|
if (otherEnd <= start) {
|
|
return null;
|
|
}
|
|
return new Slot(Math.max(start, otherStart), Math.min(end, otherEnd));
|
|
}
|
|
|
|
public int compareTo(Slot other) {
|
|
if (this.start < other.start) {
|
|
return -1;
|
|
}
|
|
if (this.start > other.start) {
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
}
|