summaryrefslogtreecommitdiff
path: root/src/net/sourceforge/plantuml/graph2/Polyline2.java
diff options
context:
space:
mode:
Diffstat (limited to 'src/net/sourceforge/plantuml/graph2/Polyline2.java')
-rw-r--r--src/net/sourceforge/plantuml/graph2/Polyline2.java110
1 files changed, 110 insertions, 0 deletions
diff --git a/src/net/sourceforge/plantuml/graph2/Polyline2.java b/src/net/sourceforge/plantuml/graph2/Polyline2.java
new file mode 100644
index 0000000..b510b17
--- /dev/null
+++ b/src/net/sourceforge/plantuml/graph2/Polyline2.java
@@ -0,0 +1,110 @@
+/* ========================================================================
+ * PlantUML : a free UML diagram generator
+ * ========================================================================
+ *
+ * (C) Copyright 2009-2014, Arnaud Roques
+ *
+ * Project Info: http://plantuml.sourceforge.net
+ *
+ * This file is part of PlantUML.
+ *
+ * Licensed under The MIT License (Massachusetts Institute of Technology License)
+ *
+ * See http://opensource.org/licenses/MIT
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining
+ * a copy of this software and associated documentation files (the "Software"),
+ * to deal in the Software without restriction, including without limitation
+ * the rights to use, copy, modify, merge, publish, distribute, sublicense,
+ * and/or sell copies of the Software, and to permit persons to whom the
+ * Software is furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included
+ * in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+ * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
+ * IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ *
+ * Original Author: Arnaud Roques
+ */
+package net.sourceforge.plantuml.graph2;
+
+import java.awt.Color;
+import java.awt.Graphics2D;
+import java.awt.geom.Line2D;
+import java.awt.geom.Point2D;
+import java.awt.geom.QuadCurve2D;
+import java.util.ArrayList;
+import java.util.List;
+
+public class Polyline2 {
+
+ private final List<Line2D.Double> lines = new ArrayList<Line2D.Double>();
+ private Point2D lastCurrent;
+ private final Point2D end;
+
+ public Polyline2(Point2D start, Point2D end) {
+ lastCurrent = start;
+ this.end = end;
+ }
+
+ public void addLine(Line2D.Double newLine) {
+ // Log.println("# Polyline2::addLine " +
+ // GeomUtils.toString(newLine));
+ if (lastCurrent.equals(newLine.getP1()) == false) {
+ lines.add(new Line2D.Double(lastCurrent, newLine.getP1()));
+ }
+ lines.add(newLine);
+ lastCurrent = newLine.getP2();
+ }
+
+ private boolean debug = false;
+
+ public void draw(Graphics2D g2d) {
+ close();
+ if (debug) {
+ g2d.setColor(Color.GREEN);
+ drawDebug(g2d);
+ }
+ g2d.setColor(Color.BLUE);
+ final List<Point2D.Double> centers = new ArrayList<Point2D.Double>();
+ for (Line2D.Double l : lines) {
+ centers.add(GeomUtils.getCenter(l));
+ }
+ g2d.draw(new Line2D.Double(lines.get(0).getP1(), centers.get(0)));
+ g2d.draw(new Line2D.Double(centers.get(centers.size() - 1), end));
+ for (int i = 0; i < lines.size() - 1; i++) {
+ final Point2D c1 = centers.get(i);
+ final Point2D c2 = centers.get(i + 1);
+ final Point2D ctrl = lines.get(i).getP2();
+ assert ctrl.equals(lines.get(i + 1).getP1());
+ final QuadCurve2D.Double quad = new QuadCurve2D.Double(c1.getX(), c1.getY(), ctrl.getX(), ctrl.getY(), c2
+ .getX(), c2.getY());
+ g2d.draw(quad);
+ }
+ if (debug) {
+ for (Point2D.Double c : centers) {
+ GeomUtils.fillPoint2D(g2d, c);
+ }
+ }
+ }
+
+ private void drawDebug(Graphics2D g2d) {
+ for (Line2D.Double l : lines) {
+ g2d.draw(l);
+ GeomUtils.fillPoint2D(g2d, l.getP1());
+ GeomUtils.fillPoint2D(g2d, l.getP2());
+ }
+ }
+
+ private void close() {
+ if (lastCurrent.equals(end) == false) {
+ lines.add(new Line2D.Double(lastCurrent, end));
+ }
+ }
+}