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.klimt;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import net.sourceforge.plantuml.klimt.drawing.UGraphic;
import net.sourceforge.plantuml.klimt.geom.XCubicCurve2D;
import net.sourceforge.plantuml.klimt.geom.XPoint2D;
import net.sourceforge.plantuml.klimt.shape.DotPath;
public class UMotif {
// ::remove file when __HAXE__
private final List points = new ArrayList<>();
public UMotif(int... data) {
assert data.length % 2 == 0;
for (int i = 0; i < data.length; i += 2) {
points.add(new XPoint2D(data[i], data[i + 1]));
}
}
public UMotif(String s) {
XPoint2D last = new XPoint2D(0, 0);
for (int i = 0; i < s.length(); i++) {
final XPoint2D read = convertPoint(s.charAt(i));
last = last.move(read);
points.add(last);
}
}
public double getLength() {
return points.get(0).distance(points.get(points.size() - 1));
}
List getPoints() {
return Collections.unmodifiableList(points);
}
public DotPath getRectangle(double width, double height) {
final double len = getLength();
final int nb1 = (int) (width / len);
DotPath h1 = drawHorizontal(0, 0, nb1);
final int nb2 = (int) (height / len);
final DotPath v1 = drawVertical(h1.getEndPoint().getX(), h1.getEndPoint().getY(), nb2);
h1 = h1.addAfter(v1);
return h1;
}
public static XPoint2D convertPoint(char c) {
final int v = convertFromChar(c);
final int x = v % 7;
final int y = v / 7;
return new XPoint2D(x - 3, y - 3);
}
public static int convertFromChar(char c) {
if (c >= 'A' && c <= 'Z') {
return c - 'A';
}
if (c >= 'a' && c <= 'w') {
return c - 'a' + 26;
}
throw new IllegalArgumentException();
}
public void drawHorizontal(UGraphic ug, double x, double y, int nb) {
final DotPath path = drawHorizontal(x, y, nb);
ug.draw(path);
}
public void drawVertical(UGraphic ug, double x, double y, int nb) {
final DotPath path = drawVertical(x, y, nb);
ug.draw(path);
}
DotPath drawHorizontal(double x, double y, int nb) {
DotPath path = new DotPath();
for (int i = 0; i < nb; i++) {
path = addHorizontal(x, y, path);
x = path.getEndPoint().getX();
y = path.getEndPoint().getY();
}
return path;
}
DotPath drawVertical(double x, double y, int nb) {
DotPath path = new DotPath();
for (int i = 0; i < nb; i++) {
path = addVertical(x, y, path);
x = path.getEndPoint().getX();
y = path.getEndPoint().getY();
}
return path;
}
private DotPath addHorizontal(double x, double y, DotPath path) {
double lastx = 0;
double lasty = 0;
for (XPoint2D p : points) {
final double x1 = lastx + x;
final double y1 = lasty + y;
final double x2 = p.getX() + x;
final double y2 = p.getY() + y;
path = path.addAfter(new XCubicCurve2D(x1, y1, x1, y1, x2, y2, x2, y2));
lastx = p.getX();
lasty = p.getY();
}
return path;
}
private DotPath addVertical(double x, double y, DotPath path) {
double lastx = 0;
double lasty = 0;
for (XPoint2D p : points) {
final double x1 = lastx + x;
final double y1 = lasty + y;
final double x2 = p.getY() + x;
final double y2 = p.getX() + y;
path = path.addAfter(new XCubicCurve2D(x1, y1, x1, y1, x2, y2, x2, y2));
lastx = p.getY();
lasty = p.getX();
}
return path;
}
}