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 Revised BSD License.
*
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the University of California, Berkeley nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* 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 BSD license.
*
* The generated images can then be used without any reference to the BSD 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.openiconic;
import java.awt.geom.AffineTransform;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.StringTokenizer;
import net.sourceforge.plantuml.klimt.UPath;
import net.sourceforge.plantuml.klimt.drawing.UGraphic;
import net.sourceforge.plantuml.klimt.geom.XPoint2D;
public class SvgPath {
// http://www.w3.org/TR/SVG11/paths.html#PathDataEllipticalArcCommands
// https://developer.mozilla.org/en-US/docs/Web/SVG/Tutorial/Paths
// http://tutorials.jenkov.com/svg/path-element.html
// https://www.w3.org/TR/SVG/paths.html#PathDataQuadraticBezierCommands
private List movements = new ArrayList<>();
private List commands = new ArrayList<>();
public SvgPath(String path) {
// System.err.println("before=" + path);
path = StringDecipher.decipher(path);
// System.err.println("after=" + path);
for (final StringTokenizer st = new StringTokenizer(path); st.hasMoreTokens();) {
final String token = st.nextToken();
if (token.matches("[a-zA-Z]")) {
commands.add(new SvgCommandLetter(token));
} else {
commands.add(new SvgCommandNumber(token));
}
}
commands = insertMissingLetter(commands);
checkArguments(commands);
SvgPosition last = new SvgPosition();
SvgPosition lastMove = new SvgPosition();
SvgPosition mirrorControlPoint = null;
final Iterator iterator = commands.iterator();
while (iterator.hasNext()) {
Movement movement = new Movement(iterator);
movement = movement.toAbsoluteUpperCase(last);
if (movement.getLetter() == 'Z')
last = lastMove;
if (movement.is('S'))
movement = movement.mutoToC(mirrorControlPoint);
movements.add(movement);
if (movement.getLetter() == 'M')
lastMove = movement.lastPosition();
if (movement.lastPosition() != null)
last = movement.lastPosition();
mirrorControlPoint = movement.getMirrorControlPoint();
}
}
private List insertMissingLetter(List commands) {
final List result = new ArrayList<>();
final Iterator it = commands.iterator();
SvgCommandLetter lastLetter = null;
while (it.hasNext()) {
final SvgCommand cmd = it.next();
// System.err.println("cmd=" + cmd);
final int nb;
if (cmd instanceof SvgCommandNumber) {
// System.err.println("INSERTING " + lastLetter);
result.add(lastLetter);
result.add(cmd);
nb = lastLetter.argumentNumber() - 1;
} else {
result.add(cmd);
lastLetter = ((SvgCommandLetter) cmd).implicit();
nb = lastLetter.argumentNumber();
}
for (int i = 0; i < nb; i++) {
final SvgCommandNumber number = (SvgCommandNumber) it.next();
result.add(number);
}
}
return result;
}
private void checkArguments(List commands) {
final Iterator it = commands.iterator();
while (it.hasNext()) {
final SvgCommandLetter cmd = (SvgCommandLetter) it.next();
final int nb = cmd.argumentNumber();
for (int i = 0; i < nb; i++) {
final SvgCommandNumber number = (SvgCommandNumber) it.next();
}
}
}
public String toSvg() {
final StringBuilder result = new StringBuilder("");
return result.toString();
}
private UPath toUPath(double factorx, double factory) {
final UPath result = UPath.none();
Movement previous = null;
for (Movement move : movements) {
final char letter = move.getLetter();
final SvgPosition position = move.lastPosition();
if (letter == 'M') {
result.moveTo(position.getXDouble() * factorx, position.getYDouble() * factory);
} else if (letter == 'C') {
final SvgPosition ctl1 = move.getSvgPosition(0);
final SvgPosition ctl2 = move.getSvgPosition(2);
result.cubicTo(ctl1.getXDouble() * factorx, ctl1.getYDouble() * factory, ctl2.getXDouble() * factorx,
ctl2.getYDouble() * factory, position.getXDouble() * factorx, position.getYDouble() * factory);
} else if (letter == 'Q') {
final SvgPosition ctl = move.getSvgPosition(0);
result.cubicTo(ctl.getXDouble() * factorx, ctl.getYDouble() * factory, ctl.getXDouble() * factorx,
ctl.getYDouble() * factory, position.getXDouble() * factorx, position.getYDouble() * factory);
} else if (letter == 'T') {
if (previous.getLetter() != 'Q')
throw new IllegalArgumentException();
// https://stackoverflow.com/questions/5287559/calculating-control-points-for-a-shorthand-smooth-svg-path-bezier-curve
final SvgPosition lastCtl = previous.getSvgPosition(0);
final SvgPosition lastP = previous.lastPosition();
final SvgPosition ctl = lastP.getMirror(lastCtl);
result.cubicTo(ctl.getXDouble() * factorx, ctl.getYDouble() * factory, ctl.getXDouble() * factorx,
ctl.getYDouble() * factory, position.getXDouble() * factorx, position.getYDouble() * factory);
} else if (letter == 'L') {
result.lineTo(position.getXDouble() * factorx, position.getYDouble() * factory);
} else if (letter == 'A') {
final double rx = move.getArgument(0);
final double ry = move.getArgument(1);
final double x_axis_rotation = move.getArgument(2);
final double large_arc_flag = move.getArgument(3);
final double sweep_flag = move.getArgument(4);
result.arcTo(rx * factorx, ry * factory, x_axis_rotation, large_arc_flag, sweep_flag,
position.getXDouble() * factorx, position.getYDouble() * factory);
} else if (letter == 'Z') {
result.closePath();
} else {
throw new UnsupportedOperationException("letter " + letter);
}
}
result.setOpenIconic(true);
return result;
}
private UPath toUPath(AffineTransform at) {
final UPath result = UPath.none();
Movement previous = null;
for (Movement move : movements) {
final char letter = move.getLetter();
final SvgPosition position = move.lastPosition();
if (letter == 'M') {
result.moveTo(position.affine(at));
} else if (letter == 'C') {
final SvgPosition ctl1 = move.getSvgPosition(0);
final SvgPosition ctl2 = move.getSvgPosition(2);
result.cubicTo(ctl1.affine(at), ctl2.affine(at), position.affine(at));
} else if (letter == 'Q') {
final SvgPosition ctl = move.getSvgPosition(0);
result.cubicTo(ctl.affine(at), ctl.affine(at), position.affine(at));
} else if (letter == 'T') {
if (previous.getLetter() != 'Q')
throw new IllegalArgumentException();
// https://stackoverflow.com/questions/5287559/calculating-control-points-for-a-shorthand-smooth-svg-path-bezier-curve
final SvgPosition lastCtl = previous.getSvgPosition(0);
final SvgPosition lastP = previous.lastPosition();
final SvgPosition ctl = lastP.getMirror(lastCtl);
result.cubicTo(ctl.affine(at), ctl.affine(at), position.affine(at));
} else if (letter == 'L') {
result.lineTo(position.affine(at));
} else if (letter == 'A') {
final double rx = move.getArgument(0);
final double ry = move.getArgument(1);
final double x_axis_rotation = move.getArgument(2);
final double large_arc_flag = move.getArgument(3);
final double sweep_flag = move.getArgument(4);
final XPoint2D tmp = position.affine(at);
result.arcTo(rx * at.getScaleX(), ry * at.getScaleY(), x_axis_rotation, large_arc_flag, sweep_flag,
tmp.getX(), tmp.getY());
} else if (letter == 'Z') {
result.closePath();
} else {
throw new UnsupportedOperationException("letter " + letter);
}
previous = move;
}
result.setOpenIconic(true);
return result;
}
public void drawMe(UGraphic ug, double factor) {
final UPath path = toUPath(factor, factor);
ug.draw(path);
}
public void drawMe(UGraphic ug, AffineTransform at) {
final UPath path = toUPath(at);
ug.draw(path);
}
}
