net.sourceforge.plantuml.project.GArrows Maven / Gradle / Ivy
// 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.project;
import java.util.ArrayList;
import java.util.List;
import net.sourceforge.plantuml.klimt.UPath;
import net.sourceforge.plantuml.klimt.UStroke;
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.UDrawable;
import net.sourceforge.plantuml.klimt.shape.UPolygon;
import net.sourceforge.plantuml.project.core.GSide;
import net.sourceforge.plantuml.utils.Direction;
public class GArrows implements UDrawable {
final static private double delta2 = 4;
private final GSide atEnd;
private final HColor backColor;
private final List points = new ArrayList<>();
public GArrows(GSide atEnd, HColor backColor) {
this.atEnd = atEnd;
this.backColor = backColor;
}
public void drawU(UGraphic ug) {
final UPath path = UPath.none();
path.moveTo(points.get(0));
for (int i = 1; i < points.size() - 1; i++)
path.lineTo(points.get(i));
path.lineTo(lastPointPatched());
path.closePath();
ug.draw(path);
ug = ug.apply(UStroke.simple()).apply(backColor.bg());
ug.draw(getHead());
}
private XPoint2D lastPointPatched() {
final XPoint2D last = points.get(points.size() - 1);
if (atEnd == GSide.LEFT)
return new XPoint2D(last.getX() - 3, last.getY());
if (atEnd == GSide.RIGHT)
return new XPoint2D(last.getX() + 3, last.getY());
return last;
}
public void addPoint(double x, double y) {
points.add(new XPoint2D(x, y));
}
private UPolygon getHead() {
final XPoint2D last = points.get(points.size() - 1);
final double x = last.getX();
final double y = last.getY();
if (atEnd == GSide.LEFT) {
final UPolygon polygon = new UPolygon("asToRight");
polygon.addPoint(x - 4, y - delta2);
polygon.addPoint(x, y);
polygon.addPoint(x - 4, y + delta2);
polygon.addPoint(x - 4, y - delta2);
return polygon;
}
if (atEnd == GSide.RIGHT) {
final UPolygon polygon = new UPolygon("asToLeft");
polygon.addPoint(x + 4, y - delta2);
polygon.addPoint(x, y);
polygon.addPoint(x + 4, y + delta2);
polygon.addPoint(x + 4, y - delta2);
return polygon;
}
assert false;
return new UPolygon();
}
// @Override
// public UPolygon asToUp() {
// final UPolygon polygon = new UPolygon("asToUp");
// polygon.addPoint(-delta2, 0);
// polygon.addPoint(0, 0);
// polygon.addPoint(delta2, 0);
// polygon.addPoint(0, -4);
// return polygon;
// }
//
// @Override
// public UPolygon asToDown() {
// final UPolygon polygon = new UPolygon("asToDown");
// polygon.addPoint(-delta2, 0);
// polygon.addPoint(0, 0);
// polygon.addPoint(delta2, 0);
// polygon.addPoint(0, 4);
// return polygon;
// }
//
// @Override
// public UPolygon asToRight() {
// final UPolygon polygon = new UPolygon("asToRight");
// polygon.addPoint(0, -delta2);
// polygon.addPoint(0, 0);
// polygon.addPoint(0, delta2);
// polygon.addPoint(4, 0);
// return polygon.translate(-4, 0);
// }
//
// @Override
// public UPolygon asToLeft() {
// final UPolygon polygon = new UPolygon("asToLeft");
// polygon.addPoint(0, -delta2);
// polygon.addPoint(0, 0);
// polygon.addPoint(0, delta2);
// polygon.addPoint(-4, 0);
// return polygon.translate(4, 0);
// }
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy