1 package edu.berkeley.slipway.gui;
3 import static com.atmel.fpslic.FpslicConstants.*;
4 import static com.atmel.fpslic.FpslicUtil.*;
5 import edu.berkeley.slipway.*;
7 import java.awt.geom.*;
8 import java.awt.event.*;
9 import java.awt.color.*;
10 import org.ibex.util.*;
18 public final Graphics2D g;
20 public G(Graphics2D g) { this.g = g; }
21 public G(Graphics g) { this((Graphics2D)g); }
23 public void line(Point2D p1, Point2D p2) { line(new P(p1), new P(p2)); }
25 public void line(P p1, P p2) { line(p1.x, p1.y, p2.x, p2.y); }
26 public void line(double x, double y, P p2) { line(x, y, p2.x, p2.y); }
27 public void line(P p1, double x, double y) { line(p1.x, p1.y, x, y); }
28 public void line(double x1, double y1, double x2, double y2) {
29 g.draw(new Line2D.Double(x1, y1, x2, y2));
31 public void line(double x1, double y1, double x2, double y2, int stroke) {
32 g.setStroke(new BasicStroke(stroke));
33 g.draw(new Line2D.Double(x1, y1, x2, y2));
34 g.setStroke(new BasicStroke(1));
37 public void color(Color c) { g.setColor(c); }
38 public void color(int color) {
39 g.setColor(new Color((color >> 16) & 0xff,
45 private ArrayList<AffineTransform> transformStack =
46 new ArrayList<AffineTransform>();
48 public void pushTransform() {
49 transformStack.add(new AffineTransform(g.getTransform()));
51 public void popTransform() {
52 AffineTransform t = transformStack.remove(transformStack.size()-1);
56 public void fillTriangle(double x1, double y1,
58 double x3, double y3) {
59 GeneralPath gp = new GeneralPath();
60 gp.moveTo((float)x1, (float)y1);
61 gp.lineTo((float)x2, (float)y2);
62 gp.lineTo((float)x3, (float)y3);
67 public void route(P p1, R r, P p2) {
68 if (p1.x < r.minx() && p1.y < r.miny()) { line(p1, r.minx(), r.miny()); route(new P(r.minx(), r.miny()), r, p2); }
69 else if (p1.x > r.maxx() && p1.y < r.miny()) { line(p1, r.maxx(), r.miny()); route(new P(r.maxx(), r.miny()), r, p2); }
70 else if (p1.x < r.minx() && p1.y > r.maxy()) { line(p1, r.minx(), r.maxy()); route(new P(r.minx(), r.maxy()), r, p2); }
71 else if (p1.x > r.maxx() && p1.y > r.maxy()) { line(p1, r.maxx(), r.maxy()); route(new P(r.maxx(), r.maxy()), r, p2); }
72 else if (p1.x < r.minx()) { line(p1, r.minx(), p1.y); route(new P(r.minx(), p1.y), r, p2); }
73 else if (p1.x > r.maxx()) { line(p1, r.maxx(), p1.y); route(new P(r.maxx(), p1.y), r, p2); }
74 else if (p1.y < r.miny()) { line(p1, p1.x, r.miny()); route(new P(p1.x, r.miny()), r, p2); }
75 else if (p1.y > r.maxy()) { line(p1, p1.x, r.maxy()); route(new P(p1.x, r.maxy()), r, p2); }
77 double updist = Math.abs(r.maxy()-p2.y);
78 double downdist = Math.abs(r.miny()-p2.y);
79 double leftdist = Math.abs(r.minx()-p2.x);
80 double rightdist = Math.abs(r.maxx()-p2.x);
81 if (updist != 0 && updist <= downdist && updist <= leftdist && updist <= rightdist)
82 { line(p2, p2.x, r.maxy()); route(p1, r, new P(p2.x, r.maxy())); }
83 else if (downdist != 0 && downdist <= updist && downdist <= leftdist && downdist <= rightdist)
84 { line(p2, p2.x, r.miny()); route(p1, r, new P(p2.x, r.miny())); }
85 else if (leftdist != 0 && leftdist <= downdist && leftdist <= updist && leftdist <= rightdist)
86 { line(p2, r.minx(), p2.y); route(p1, r, new P(r.minx(), p2.y)); }
87 else if (rightdist != 0 && rightdist <= updist && rightdist <= downdist && rightdist <= leftdist)
88 { line(p2, r.maxx(), p2.y); route(p1, r, new P(r.maxx(), p2.y)); }
90 if (p2.x == p1.x && (p2.x==r.maxx() || p2.x==r.minx())) line(p1, p2);
91 else if (p2.y == p1.y && (p2.y==r.maxy() || p2.y==r.miny())) line(p1, p2);
93 // these cases are where p1 and p2 are each on opposite sides
94 else if (p2.y==r.maxy() && p1.y==r.miny() && p1.x!=r.minx() && p1.x!=r.maxx() && p2.x!=r.minx() && p2.x!=r.maxx()) { }
95 else if (p1.y==r.maxy() && p2.y==r.miny() && p1.x!=r.minx() && p1.x!=r.maxx() && p2.x!=r.minx() && p2.x!=r.maxx()) { }
96 else if (p1.x==r.maxx() && p2.x==r.minx() && p1.y!=r.miny() && p1.y!=r.maxy() && p2.y!=r.miny() && p2.y!=r.maxy()) { }
97 else if (p2.x==r.maxx() && p1.x==r.minx() && p1.y!=r.miny() && p1.y!=r.maxy() && p2.y!=r.miny() && p2.y!=r.maxy()) { }
100 if (Math.abs(p1.x-p2.x) < Math.abs(p1.y-p2.y)) {
101 if (p1.x == r.minx() || p1.x == r.maxx()) {
102 line(p2, p1.x, p2.y);
103 route(p1, r, new P(p1.x, p2.y));
105 line(p1, p2.x, p1.y);
106 route(p2, r, new P(p2.x, p1.y));
109 if (p1.y == r.miny() || p1.y == r.maxy()) {
110 line(p2, p2.x, p1.y);
111 route(p1, r, new P(p2.x, p1.y));
113 line(p1, p1.x, p2.y);
114 route(p2, r, new P(p1.x, p2.y));