net.sourceforge.plantuml.klimt.shape.DotPath Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plantuml-mit Show documentation
Show all versions of plantuml-mit Show documentation
PlantUML is a component that allows to quickly write diagrams from text.
// THIS FILE HAS BEEN GENERATED BY A PREPROCESSOR.
/* +=======================================================================
* |
* | 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/liberapay (only 1€ per month!)
* https://plantuml.com/paypal
*
*
* PlantUML is free software; you can redistribute it and/or modify it
* under the terms of the MIT License.
*
* See http://opensource.org/licenses/MIT
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
* IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* PlantUML can occasionally display sponsored or advertising messages. Those
* messages are usually generated on welcome or error images and never on
* functional diagrams.
* See https://plantuml.com/professional if you want to remove them
*
* Images (whatever their format : PNG, SVG, EPS...) generated by running PlantUML
* are owned by the author of their corresponding sources code (that is, their
* textual description in PlantUML language). Those images are not covered by
* this MIT license.
*
* The generated images can then be used without any reference to the MIT license.
* It is not even necessary to stipulate that they have been generated with PlantUML,
* although this will be appreciated by the PlantUML team.
*
* There is an exception : if the textual description in PlantUML language is also covered
* by any license, then the generated images are logically covered
* by the very same license.
*
* This is the IGY distribution (Install GraphViz by Yourself).
* You have to install GraphViz and to setup the GRAPHVIZ_DOT environment variable
* (see https://plantuml.com/graphviz-dot )
*
* Icons provided by OpenIconic : https://useiconic.com/open
* Archimate sprites provided by Archi : http://www.archimatetool.com
* Stdlib AWS provided by https://github.com/milo-minderbinder/AWS-PlantUML
* Stdlib Icons provided https://github.com/tupadr3/plantuml-icon-font-sprites
* ASCIIMathML (c) Peter Jipsen http://www.chapman.edu/~jipsen
* ASCIIMathML (c) David Lippman http://www.pierce.ctc.edu/dlippman
* CafeUndZopfli ported by Eugene Klyuchnikov https://github.com/eustas/CafeUndZopfli
* Brotli (c) by the Brotli Authors https://github.com/google/brotli
* Themes (c) by Brett Schwarz https://github.com/bschwarz/puml-themes
* Twemoji (c) by Twitter at https://twemoji.twitter.com/
*
*/
package net.sourceforge.plantuml.klimt.shape;
import java.awt.Graphics2D;
import java.awt.geom.CubicCurve2D;
import java.awt.geom.GeneralPath;
import java.awt.geom.Line2D;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.List;
import java.util.Objects;
import java.util.Set;
import net.sourceforge.plantuml.klimt.UPath;
import net.sourceforge.plantuml.klimt.UShape;
import net.sourceforge.plantuml.klimt.UTranslate;
import net.sourceforge.plantuml.klimt.geom.BezierUtils;
import net.sourceforge.plantuml.klimt.geom.EnsureVisible;
import net.sourceforge.plantuml.klimt.geom.MinFinder;
import net.sourceforge.plantuml.klimt.geom.MinMax;
import net.sourceforge.plantuml.klimt.geom.Moveable;
import net.sourceforge.plantuml.klimt.geom.PointAndAngle;
import net.sourceforge.plantuml.klimt.geom.RectangleArea;
import net.sourceforge.plantuml.klimt.geom.USegmentType;
import net.sourceforge.plantuml.klimt.geom.XCubicCurve2D;
import net.sourceforge.plantuml.klimt.geom.XPoint2D;
public class DotPath implements UShape, Moveable {
public static class TriPoints {
public TriPoints(XPoint2D p1, XPoint2D p2, XPoint2D p) {
x1 = p1.getX();
y1 = p1.getY();
x2 = p2.getX();
y2 = p2.getY();
x = p.getX();
y = p.getY();
}
public final double x1;
public final double y1;
public final double x2;
public final double y2;
public final double x;
public final double y;
// @Override
// public String toString() {
// return "[" + x1 + "," + y1 + " " + x2 + "," + y2 + " " + x + "," + y
// + "]";
// }
}
private final List beziers = new ArrayList<>();
private String comment;
private String codeLine;
public DotPath copy() {
final DotPath result = new DotPath();
for (XCubicCurve2D c : this.beziers)
result.beziers.add(new XCubicCurve2D(c.x1, c.y1, c.ctrlx1, c.ctrly1, c.ctrlx2, c.ctrly2, c.x2, c.y2));
return result;
}
public static DotPath fromBeziers(List beziers) {
final DotPath result = new DotPath();
result.beziers.addAll(Objects.requireNonNull(beziers));
return result;
}
public DotPath() {
}
public DotPath addCurve(XPoint2D pt1, XPoint2D pt2, XPoint2D pt3, XPoint2D pt4) {
final List beziersNew = new ArrayList<>(beziers);
beziersNew.add(new XCubicCurve2D(pt1.getX(), pt1.getY(), pt2.getX(), pt2.getY(), pt3.getX(), pt3.getY(),
pt4.getX(), pt4.getY()));
return fromBeziers(beziersNew);
}
public DotPath addCurve(XPoint2D pt2, XPoint2D pt3, XPoint2D pt4) {
final XCubicCurve2D last = beziers.get(beziers.size() - 1);
final XPoint2D p1 = last.getP2();
return addCurve(p1, pt2, pt3, pt4);
}
// private final String print;
public XPoint2D getStartPoint() {
return beziers.get(0).getP1();
}
public Set sample() {
final Set result = new HashSet<>();
for (XCubicCurve2D bez : beziers)
sample(bez, result);
return Collections.unmodifiableSet(result);
}
private static void sample(XCubicCurve2D bez, Set result) {
final XPoint2D p1 = bez.getCtrlP1();
final XPoint2D p2 = bez.getCtrlP2();
if (bez.getFlatnessSq() > 0.5 || p1.distance(p2) > 4) {
final XCubicCurve2D left = XCubicCurve2D.none();
final XCubicCurve2D right = XCubicCurve2D.none();
bez.subdivide(left, right);
sample(left, result);
sample(right, result);
} else {
result.add(p1);
result.add(p2);
}
}
public PointAndAngle getMiddle() {
XPoint2D result = null;
double angle = 0;
for (XCubicCurve2D bez : beziers) {
final XCubicCurve2D left = XCubicCurve2D.none();
final XCubicCurve2D right = XCubicCurve2D.none();
bez.subdivide(left, right);
final XPoint2D p1 = left.getP1();
final XPoint2D p2 = left.getP2();
final XPoint2D p3 = right.getP1();
final XPoint2D p4 = right.getP2();
if (result == null || getCost(p1) < getCost(result)) {
result = p1;
angle = BezierUtils.getStartingAngle(left);
}
if (getCost(p2) < getCost(result)) {
result = p2;
angle = BezierUtils.getEndingAngle(left);
}
if (getCost(p3) < getCost(result)) {
result = p3;
angle = BezierUtils.getStartingAngle(right);
}
if (getCost(p4) < getCost(result)) {
result = p4;
angle = BezierUtils.getEndingAngle(right);
}
}
return new PointAndAngle(result, angle);
}
private double getCost(XPoint2D pt) {
final XPoint2D start = getStartPoint();
final XPoint2D end = getEndPoint();
return pt.distanceSq(start) + pt.distanceSq(end);
}
// public void forceStartPoint(double x, double y) {
// beziers.get(0).x1 = x;
// beziers.get(0).y1 = y;
// beziers.get(0).ctrlx1 = x;
// beziers.get(0).ctrly1 = y;
// }
public void moveStartPoint(UTranslate move) {
moveStartPoint(move.getDx(), move.getDy());
}
public void moveEndPoint(UTranslate move) {
moveEndPoint(move.getDx(), move.getDy());
}
public void moveStartPoint(double dx, double dy) {
if (beziers.size() > 1 && Math.sqrt(dx * dx + dy * dy) >= beziers.get(0).getLength()) {
dx -= beziers.get(1).x1 - beziers.get(0).x1;
dy -= beziers.get(1).y1 - beziers.get(0).y1;
beziers.remove(0);
}
beziers.get(0).x1 += dx;
beziers.get(0).y1 += dy;
beziers.get(0).ctrlx1 += dx;
beziers.get(0).ctrly1 += dy;
}
public XPoint2D getEndPoint() {
return beziers.get(beziers.size() - 1).getP2();
}
// public void forceEndPoint(double x, double y) {
// beziers.get(beziers.size() - 1).x2 = x;
// beziers.get(beziers.size() - 1).y2 = y;
// beziers.get(beziers.size() - 1).ctrlx2 = x;
// beziers.get(beziers.size() - 1).ctrly2 = y;
// }
public void moveEndPoint(double dx, double dy) {
beziers.get(beziers.size() - 1).x2 += dx;
beziers.get(beziers.size() - 1).y2 += dy;
beziers.get(beziers.size() - 1).ctrlx2 += dx;
beziers.get(beziers.size() - 1).ctrly2 += dy;
}
public MinFinder getMinFinder() {
final MinFinder result = new MinFinder();
for (XCubicCurve2D c : beziers) {
result.manage(c.x1, c.y1);
result.manage(c.x2, c.y2);
result.manage(c.ctrlx1, c.ctrly1);
result.manage(c.ctrlx2, c.ctrly2);
}
return result;
}
public MinMax getMinMax() {
MinMax result = MinMax.getEmpty(false);
for (XCubicCurve2D c : beziers) {
result = result.addPoint(c.x1, c.y1);
result = result.addPoint(c.x2, c.y2);
result = result.addPoint(c.ctrlx1, c.ctrly1);
result = result.addPoint(c.ctrlx2, c.ctrly2);
}
return result;
}
public double getMinDist(XPoint2D ref) {
double result = Double.MAX_VALUE;
for (XCubicCurve2D c : beziers) {
final double d1 = ref.distance(c.x1, c.y1);
if (d1 < result)
result = d1;
final double d2 = ref.distance(c.x2, c.y2);
if (d2 < result)
result = d2;
final double d3 = ref.distance(c.ctrlx1, c.ctrly1);
if (d3 < result)
result = d3;
final double d4 = ref.distance(c.ctrlx2, c.ctrly2);
if (d4 < result)
result = d4;
}
return result;
}
public Line2D getEndTangeante() {
final XCubicCurve2D last = beziers.get(beziers.size() - 1);
double dx = last.x2 - last.ctrlx2;
double dy = last.y2 - last.ctrly2;
if (dx == 0 && dy == 0) {
dx = last.x2 - last.x1;
dy = last.y2 - last.y1;
}
return new Line2D.Double(last.x2, last.y2, last.x2 + dx, last.y2 + dy);
}
public double getEndAngle() {
final Line2D tan = getEndTangeante();
final double theta1 = Math.atan2(tan.getY2() - tan.getY1(), tan.getX2() - tan.getX1());
return theta1;
}
public double getStartAngle() {
final Line2D tan = getStartTangeante();
final double theta1 = Math.atan2(tan.getY2() - tan.getY1(), tan.getX2() - tan.getX1());
return theta1;
}
public Line2D getStartTangeante() {
final XCubicCurve2D first = beziers.get(0);
double dx = first.ctrlx1 - first.x1;
double dy = first.ctrly1 - first.y1;
if (dx == 0 && dy == 0) {
dx = first.x2 - first.x1;
dy = first.y2 - first.y1;
}
return new Line2D.Double(first.x1, first.y1, first.x1 + dx, first.y1 + dy);
}
public DotPath addBefore(XCubicCurve2D before) {
final List copy = new ArrayList<>(beziers);
copy.add(0, before);
return fromBeziers(copy);
}
private DotPath addBefore(DotPath other) {
final List copy = new ArrayList<>(beziers);
copy.addAll(0, other.beziers);
return fromBeziers(copy);
}
public DotPath addAfter(XCubicCurve2D after) {
final List copy = new ArrayList<>(beziers);
copy.add(after);
return fromBeziers(copy);
}
public DotPath addAfter(DotPath other) {
final List copy = new ArrayList<>(beziers);
copy.addAll(other.beziers);
return fromBeziers(copy);
}
public void draw(Graphics2D g2d, double x, double y) {
final GeneralPath p = new GeneralPath();
for (XCubicCurve2D bez : beziers) {
final CubicCurve2D.Double bez2 = new CubicCurve2D.Double(x + bez.x1, y + bez.y1, x + bez.ctrlx1,
y + bez.ctrly1, x + bez.ctrlx2, y + bez.ctrly2, x + bez.x2, y + bez.y2);
p.append(bez2, true);
}
g2d.draw(p);
}
public void manageEnsureVisible(double x, double y, EnsureVisible visible) {
for (XCubicCurve2D bez : beziers) {
visible.ensureVisible(x + bez.x1, y + bez.y1);
visible.ensureVisible(x + bez.x2, y + bez.y2);
}
}
public UPath toUPath() {
final UPath result = new UPath(comment, codeLine);
boolean start = true;
for (XCubicCurve2D bez : beziers) {
if (start) {
result.add(new double[] { bez.x1, bez.y1 }, USegmentType.SEG_MOVETO);
start = false;
}
result.add(new double[] { bez.ctrlx1, bez.ctrly1, bez.ctrlx2, bez.ctrly2, bez.x2, bez.y2 },
USegmentType.SEG_CUBICTO);
}
return result;
}
static public String toString(XCubicCurve2D c) {
return "(" + c.x1 + "," + c.y1 + ") " + "(" + c.ctrlx1 + "," + c.ctrly1 + ") " + "(" + c.ctrlx2 + "," + c.ctrly2
+ ") " + "(" + c.x2 + "," + c.y2 + ") ";
}
@Override
public String toString() {
final StringBuilder sb = new StringBuilder();
for (XCubicCurve2D c : beziers) {
sb.append(toString(c));
sb.append(" - ");
}
return sb.toString();
}
public static XCubicCurve2D reverse(XCubicCurve2D curv) {
return new XCubicCurve2D(curv.getX2(), curv.getY2(), curv.getCtrlX2(), curv.getCtrlY2(), curv.getCtrlX1(),
curv.getCtrlY1(), curv.getX1(), curv.getY1());
}
public DotPath reverse() {
final List reverse = new ArrayList<>(beziers);
Collections.reverse(reverse);
final List copy = new ArrayList<>();
for (XCubicCurve2D cub : reverse)
copy.add(reverse(cub));
return fromBeziers(copy);
}
public void moveSvek(double deltaX, double deltaY) {
for (int i = 0; i < beziers.size(); i++) {
final XCubicCurve2D c = beziers.get(i);
beziers.set(i, new XCubicCurve2D(c.x1 + deltaX, c.y1 + deltaY, c.ctrlx1 + deltaX, c.ctrly1 + deltaY,
c.ctrlx2 + deltaX, c.ctrly2 + deltaY, c.x2 + deltaX, c.y2 + deltaY));
}
}
public final List getBeziers() {
return Collections.unmodifiableList(beziers);
}
public DotPath simulateCompound(RectangleArea head, RectangleArea tail) {
if (head == null && tail == null)
return this;
// System.err.println("head=" + head + " tail=" + tail);
DotPath me = this;
if (tail != null) {
// System.err.println("beziers1=" + this.toString());
if (tail.contains(getStartPoint())) {
final DotPath result = new DotPath();
int idx = 0;
while (idx + 1 < this.beziers.size() && tail.contains(this.beziers.get(idx).getP2())) {
if (tail.contains(this.beziers.get(idx).getP1()) == false)
throw new IllegalStateException();
idx++;
}
if (tail.contains(this.beziers.get(idx).getP2())) {
// System.err.println("strange1");
} else {
assert tail.contains(this.beziers.get(idx).getP1());
assert tail.contains(this.beziers.get(idx).getP2()) == false;
XCubicCurve2D current = this.beziers.get(idx);
for (int k = 0; k < 8; k++) {
final XCubicCurve2D part1 = XCubicCurve2D.none();
final XCubicCurve2D part2 = XCubicCurve2D.none();
current.subdivide(part1, part2);
assert part1.getP2().equals(part2.getP1());
if (tail.contains(part1.getP2())) {
current = part2;
} else {
result.beziers.add(0, part2);
current = part1;
}
}
for (int i = idx + 1; i < this.beziers.size(); i++)
result.beziers.add(this.beziers.get(i));
me = result;
}
}
}
if (head != null) {
final DotPath result = new DotPath();
if (head.contains(getEndPoint())) {
for (XCubicCurve2D current : me.beziers) {
if (head.contains(current.getP2()) == false) {
result.beziers.add(current);
} else {
if (head.contains(current.getP1())) {
return me;
}
assert head.contains(current.getP1()) == false;
assert head.contains(current.getP2());
for (int k = 0; k < 8; k++) {
final XCubicCurve2D part1 = XCubicCurve2D.none();
final XCubicCurve2D part2 = XCubicCurve2D.none();
current.subdivide(part1, part2);
assert part1.getP2().equals(part2.getP1());
if (head.contains(part1.getP2())) {
current = part1;
} else {
result.beziers.add(part1);
current = part2;
}
}
return result;
}
}
}
}
return me;
}
public boolean isLine() {
for (XCubicCurve2D curve : beziers)
if (curve.getFlatnessSq() > 0.001)
return false;
return true;
}
public void setCommentAndCodeLine(String comment, String codeLine) {
this.comment = comment;
this.codeLine = codeLine;
}
}