Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
// 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 Eclipse Public License.
*
* THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC
* LICENSE ("AGREEMENT"). [Eclipse Public License - v 1.0]
*
* ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES
* RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.
*
* You may obtain a copy of the License at
*
* http://www.eclipse.org/legal/epl-v10.html
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* 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 EPL license.
*
* The generated images can then be used without any reference to the EPL 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.jsondiagram;
import java.util.ArrayList;
import java.util.List;
import h.ST_Agedgeinfo_t;
import h.ST_bezier;
import h.ST_pointf;
import h.ST_splines;
import net.sourceforge.plantuml.klimt.UPath;
import net.sourceforge.plantuml.klimt.UStroke;
import net.sourceforge.plantuml.klimt.UTranslate;
import net.sourceforge.plantuml.klimt.color.HColor;
import net.sourceforge.plantuml.klimt.drawing.UGraphic;
import net.sourceforge.plantuml.klimt.geom.XPoint2D;
import net.sourceforge.plantuml.klimt.shape.UEllipse;
public class JsonCurve {
private final List points = new ArrayList<>();
private double maxX, maxY;
private final Mirror xMirror;
private final double veryFirstLine;
private final XPoint2D sp;
private final XPoint2D ep;
public JsonCurve(ST_Agedgeinfo_t data, Mirror xMirror, double veryFirstLine) {
this.veryFirstLine = veryFirstLine;
this.xMirror = xMirror;
final ST_splines splines = data.spl;
if (splines.size != 1) {
throw new IllegalStateException();
}
final ST_bezier beziers = splines.list.get__(0);
for (int i = 0; i < beziers.size; i++) {
final XPoint2D pt = getPoint(splines, i);
maxX = Math.max(maxX, pt.getX());
maxY = Math.max(maxY, pt.getY());
points.add(pt);
}
if (beziers.sp.x == 0 && beziers.sp.y == 0) {
sp = null;
} else {
sp = new XPoint2D(beziers.sp.x, beziers.sp.y);
}
if (beziers.ep.x == 0 && beziers.ep.y == 0) {
ep = null;
} else {
ep = new XPoint2D(beziers.ep.x, beziers.ep.y);
}
}
private XPoint2D getPoint(ST_splines splines, int i) {
final ST_bezier beziers = splines.list.get__(0);
final ST_pointf pt = beziers.list.get__(i);
return new XPoint2D(pt.x, pt.y);
}
public void drawCurve(HColor color, UGraphic ug) {
final UPath path = UPath.none();
path.moveTo(getVeryFirst());
path.lineTo(xMirror.invAndXYSwitch(points.get(0)));
for (int i = 1; i < points.size(); i += 3) {
final XPoint2D pt2 = xMirror.invAndXYSwitch(points.get(i));
final XPoint2D pt3 = xMirror.invAndXYSwitch(points.get(i + 1));
final XPoint2D pt4 = xMirror.invAndXYSwitch(points.get(i + 2));
path.cubicTo(pt2, pt3, pt4);
}
ug.draw(path);
if (ep != null) {
final XPoint2D last = xMirror.invAndXYSwitch(points.get(points.size() - 1));
final XPoint2D trueEp = xMirror.invAndXYSwitch(ep);
new Arrow(last, trueEp).drawArrow(ug.apply(color.bg()));
}
}
public void drawSpot(UGraphic ug) {
final double size = 3;
ug = ug.apply(UTranslate.point(getVeryFirst()).compose(new UTranslate(-size, -size)));
ug.apply(UStroke.simple()).draw(UEllipse.build(2 * size, 2 * size));
}
private XPoint2D getVeryFirst() {
return supp(xMirror.invAndXYSwitch(points.get(0)), xMirror.invAndXYSwitch(points.get(1)), veryFirstLine);
}
private static XPoint2D supp(XPoint2D center, XPoint2D direction, double len) {
final double full = center.distance(direction);
final double dx = (center.getX() - direction.getX()) / full;
final double dy = (center.getY() - direction.getY()) / full;
return new XPoint2D(center.getX() + dx * len, center.getY() + dy * len);
}
public double getMaxX() {
return maxX;
}
public double getMaxY() {
return maxY;
}
}