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.posimo;
import static java.nio.charset.StandardCharsets.UTF_8;
import java.io.ByteArrayOutputStream;
import java.io.IOException;
import java.io.OutputStream;
import java.util.Collection;
import java.util.List;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import net.sourceforge.plantuml.dot.Graphviz;
import net.sourceforge.plantuml.dot.GraphvizUtils;
import net.sourceforge.plantuml.dot.ProcessState;
import net.sourceforge.plantuml.klimt.geom.MinFinder;
import net.sourceforge.plantuml.klimt.geom.XDimension2D;
import net.sourceforge.plantuml.klimt.geom.XPoint2D;
import net.sourceforge.plantuml.klimt.shape.DotPath;
import net.sourceforge.plantuml.security.SFile;
import net.sourceforge.plantuml.svek.SvgResult;
import net.sourceforge.plantuml.svek.YDelta;
public class GraphvizSolverB {
// ::remove file when __CORE__
// static private void traceDotString(String dotString) throws IOException {
// final File f = SecurityUtils.File("dottmpfile" + UniqueSequence.getValue() +
// ".tmp");
// PrintWriter pw = null;
// try {
// pw = SecurityUtils.PrintWriter(new FileWriter(f));
// pw.print(dotString);
// Log.info("Creating file " + f);
// } finally {
// if (pw != null) {
// pw.close();
// }
// }
// }
//
// static private void traceSvgString(String svg) throws IOException {
// final File f = SecurityUtils.File("svgtmpfile" + UniqueSequence.getValue() +
// ".svg");
// PrintWriter pw = null;
// try {
// pw = SecurityUtils.PrintWriter(new FileWriter(f));
// pw.print(svg);
// Log.info("Creating file " + f);
// } finally {
// if (pw != null) {
// pw.close();
// }
// }
// }
public XDimension2D solve(Cluster root, Collection paths) throws IOException {
final String dotString = new DotxMaker(root, paths).createDotString("nodesep=0.2;", "ranksep=0.2;");
// if (OptionFlags.getInstance().isKeepTmpFiles()) {
// traceDotString(dotString);
// }
final MinFinder minMax = new MinFinder();
// Log.println("dotString=" + dotString);
// exportPng(dotString, SecurityUtils.File("png", "test1.png"));
final Graphviz graphviz = GraphvizUtils.create(null, dotString, "svg");
final ByteArrayOutputStream baos = new ByteArrayOutputStream();
final ProcessState state = graphviz.createFile3(baos);
baos.close();
if (state.differs(ProcessState.TERMINATED_OK())) {
throw new IllegalStateException("Timeout2 " + state);
}
final byte[] result = baos.toByteArray();
final String s = new String(result, UTF_8);
// Log.println("result=" + s);
// if (OptionFlags.getInstance().isKeepTmpFiles()) {
// traceSvgString(s);
// }
final Pattern pGraph = Pattern.compile("(?m)\\" + start + "");
if (p1 == -1) {
throw new IllegalStateException();
}
final List pointsList = extractPointsList(s, p1, yDelta);
b.setX(getMinX(pointsList));
b.setY(getMinY(pointsList));
minMax.manage(b.getPosition());
}
for (Cluster cl : root.getSubClusters()) {
final String start = "cluster" + cl.getUid();
final int p1 = s.indexOf("" + start + "");
if (p1 == -1) {
throw new IllegalStateException();
}
final List pointsList = extractPointsList(s, p1, yDelta);
cl.setX(getMinX(pointsList));
cl.setY(getMinY(pointsList));
final double w = getMaxX(pointsList) - getMinX(pointsList);
final double h = getMaxY(pointsList) - getMinY(pointsList);
cl.setHeight(h);
cl.setWidth(w);
minMax.manage(cl.getPosition());
}
for (Path p : paths) {
final String start = "b" + p.getStart().getUid();
final String end = "b" + p.getEnd().getUid();
final String searched = "" + start + "->" + end + "";
final int p1 = s.indexOf(searched);
if (p1 == -1) {
throw new IllegalStateException(searched);
}
final int p2 = s.indexOf(" d=\"", p1);
final int p3 = s.indexOf("\"", p2 + " d=\"".length());
final String points = s.substring(p2 + " d=\"".length(), p3);
final DotPath dotPath = new SvgResult(points, yDelta).toDotPath();
p.setDotPath(dotPath);
minMax.manage(dotPath.getMinFinder());
// Log.println("pointsList=" + pointsList);
if (p.getLabel() != null) {
final List pointsList = extractPointsList(s, p1, yDelta);
final double x = getMinX(pointsList);
final double y = getMinY(pointsList);
p.setLabelPosition(x, y);
minMax.manage(x, y);
}
}
return new XDimension2D(width, height);
}
static private List extractPointsList(final String svg, final int starting, final YDelta yDelta) {
return new SvgResult(svg, yDelta).substring(starting).extractList(SvgResult.POINTS_EQUALS);
}
static private double getMaxX(List points) {
double result = points.get(0).x;
for (int i = 1; i < points.size(); i++) {
if (points.get(i).x > result) {
result = points.get(i).x;
}
}
return result;
}
static private double getMinX(List points) {
double result = points.get(0).x;
for (int i = 1; i < points.size(); i++) {
if (points.get(i).x < result) {
result = points.get(i).x;
}
}
return result;
}
static private double getMaxY(List points) {
double result = points.get(0).y;
for (int i = 1; i < points.size(); i++) {
if (points.get(i).y > result) {
result = points.get(i).y;
}
}
return result;
}
static private double getMinY(List points) {
double result = points.get(0).y;
for (int i = 1; i < points.size(); i++) {
if (points.get(i).y < result) {
result = points.get(i).y;
}
}
return result;
}
private void exportPng(final String dotString, SFile f) throws IOException {
final Graphviz graphviz = GraphvizUtils.create(null, dotString, "png");
try (OutputStream os = f.createBufferedOutputStream()) {
final ProcessState state = graphviz.createFile3(os);
if (state.differs(ProcessState.TERMINATED_OK())) {
throw new IllegalStateException("Timeout3 " + state);
}
}
}
private Path getPath(Collection paths, int start, int end) {
for (Path p : paths) {
if (p.getStart().getUid() == start && p.getEnd().getUid() == end) {
return p;
}
}
throw new IllegalArgumentException();
}
}
